Problem 1 [3 points) Let A, B be regular languages over alphabet E. Is the following language regular? Prove your answer. A2 = {x|x A, R&B} Problem 2 [3 points) Let C be a language defined over alphabet {0,1} as follows. Is C regular? Prove your answer. C = The set of strings with equal number of 010's and 101's