QUESTION 3 This problem concerns the pumping lemma (Theorem 1.70, page 78 in our text). Suppose that you have a language A, and you have a single string s A satisfying Isl p (p is the pumping length), and you can prove that it is possible to break s into three pieces, s=xyz such that the three condition listed in the Theorem are satisfied.. Then what can you say with certainty about the language A ? O Nothing can be said with certainty about A with regard to whether or not A is regular. O A is not regular O A is regular 10 points S QUESTION 5 Consider the language L = a*b* L is regular, and so the pumping lemma applies to it. Let s= a b where p is the pumping length referred to in Theorem 1.70. Since s E L and Isl p, it is possible to break s into three pieces, s=xyz such that the three conditions of the pumping lemma are satisfied. Select all of the ways that s can be broken into s= xyz such that the conditions (1, 2, and 3) of the pumping lemma are satisfied. 0 x=ap-2 p2, y=aabb, z=h-2 x=ab, y=b, z=b-2 Ox=a-, y =a, z=b x=a", y=e, z=b x=a", y=bbb, z=b-3 10 points