Q3. 5 Points (T/F Questions) In each of the following questions, mark T if it is always true. In this case, no explanation is needed. Otherwise mark F and justify briefly, for instance, by giving a counter-example a). Suppose R is a regular language and L is any subset of R. Then L is regular (b). Let L (a"b:n 20). Then the string aba b is in L3 (note: L3 LLL) (c). The language L(00) has no strings. (d) If L1 is finite and L1 U L2 is regular, then L2 is regular (e) Let L be any language. Then R = L*-L is the complement of L, that is, R in cludes every string that is not in L