b, a C, E + E , $ + 93 94 VE, E + E, E + AA 91 92 EE a, e a E, E + E 95 start , $ 96 WA 97 b, + c, a E This question has four parts, each referring to the PDA described by the state diagr above. For each part, you must explain and justify your answer. Answers without explanation or justification will not receive any points. [Hint: For your explanation a justification, you could talk about the states that the PDA moves through when it receives a certain input, and what happens on the stack.] (a) [2 points] Does the PDA accept the string e? (b) [2 points] Does the PDA accept the string aaabbb? (c) [2 points] Does the PDA accept the string aabbbcccc? (d) [4 points] Does the PDA accept all strings of the form anbmch