Context-Free Languages.

Give STATE DIAGRAM OF PDAs that generate the following languages:

Question 1:

Question 2:

{w#xwR is a substring of x for w,x{0,1}} STXT0T01T1#XX0X1X (g) The set of strings over the alphabet {a,b} with more a 's than b 's (={a,b}) STTaTTTaTbbTaa