I need the solve for this Automata and Computability course problem solution.

Q3.2 String Acceptance checking (PDA) 2.0 points possible (graded, results hidden) Consider the following Push Down Automaton (Diagram 3.2), where q0 is the start state, q8 is the final state, e is epsilon and Zo is the stack symbol. = (a, b) Notational convention: Arrow (-) and slash () in the transition labels represent the same thing, e.g. b, b-bb and b, b/bb have the same meaning go azo/azo a,ala a,ala (98) e, ZO/ZO b, ale b,20/zo a.alaa 94 la,ala a, ala b,ale Fig. 3.2 1. Which of the following strings are be accepted by the above PDA? aaaaaabbbb aaaaaabbb aaaaabbb aaaaaaaaaaaabbbb aaaaaaaaaaaabbbbb aaaaaaaaaaabbbbb 2. Choose the most appropriate language that describe the PDA in figure 3.2 over the alphabet (a, b). (mark all those are applicable)? L= {a3mbn>2) L= { an>=2) L= {a25+?|n>=1) L= { amb" |n>=1) L={bn> 0) OL= { an>=0)