True/False 1. The complement of a non-regular language can never be regular. 2. The union of an infinite number of regular languages must be regular. 3. The intersection of two non-regular languages is always non-regular 4. IfL is regular, then so is {xy : X E L and y L}. 5. If R is a subset of S, S is a subset of T, and both R and I are regular, then S must be regular. 6. Every infinite regular language L can be written as the intersection of infinitely many different regular languages 7. L = {w E {0,1}* : the number represented in binary by w is a multiple of 5 } is a context-free language. 8. Every context-free language is infinite.