q1, reject state

q2 and q3 is accept state

q1 to q2 is: 0, ;0

q1 to q3 is : 1, ;1

q2 to q2 is : 1,0; and 0,;0

q3 to q3 is : 1,;1 and 0,1;

2. (6 points) Consider the PDA M over the alphabet 0,1) given by the state diagram below. For each string below, write ACCEPT if the string is accepted by M and REJECT if the string is rejected by M. Justifications aren't required for credit for this question, but it's good practice to think about how you would explain why your answer is true. (a) E (b) 0 (c) 01 (d) 011 1,0: o.E:0 02 al E: 93 State diagram for PDA M (e) 001 (f) 00111