![1. True or False. [2 points each] For each incorrect answer, 2 points will be subtracted. The union of any two regular langua](https://media.cheggcdn.com/media%2F1f7%2F1f7956a8-7b60-4bb2-ac48-789ea7c2d09f%2Fimage.png)
1. True or False. [2 points each] For each incorrect answer, 2 points will be subtracted. The union of any two regular languages is regular If L is any regular language, define PREF(L) to be the set of all prefixes of strings in L. (A (b)I prefix of a string w is a substring consisting of the first k symbols of w for some k.) Then PREF(L) is regular (c)Every subset of a regular language
OR
PayPal Gateway not configured
OR
PayPal Gateway not configured