please by typed

2. Consider the PDA over the alphabet {0, 1) given by the state diagram 1,0:e g0 q1 q4 q3 q2 1,0: a) Write a description in set builder notation of the language that is recognized by this PDA b) Assume that the formal description of the PDA above is given by (Q,X, , q,F) and describe each part of this formal description. (your delta function can just be a list.) c) Use the pumping lemma to show that the language recognized by this PDA is non-regular. 2. Consider the PDA over the alphabet {0, 1) given by the state diagram 1,0:e g0 q1 q4 q3 q2 1,0: a) Write a description in set builder notation of the language that is recognized by this PDA b) Assume that the formal description of the PDA above is given by (Q,X, , q,F) and describe each part of this formal description. (your delta function can just be a list.) c) Use the pumping lemma to show that the language recognized by this PDA is non-regular