PDA, NFA and Turing Machine

QUESTION 2 Among the following NFAs, which NFA is the resultant NFA transformed fro QUESTION 25 A. The following empty stack PDA can be obtained from, the grammar S-> ? c l aasbb (0.a a pop.0) -Rule1 (Obb pop.O) -Rule2 (0 c.c.pop.0) -Rule3 (o S -pop pushb)push(b) push/(S) push(a) push(a).0) -Rule4 (OAS pop.0) - Rule5 (O A S.pop.push(c)> 0) -Rule6 Which of the following sequence of PDA transitions will accept the string aacbb O Ruled,Rule1 Rule1 Rule6, Rule3,Rule2,Rule2 C. ? Ruled,Rule1,Rule6,Rule3,Rule2Rule1.Rule2 O Ruled Rule1 Rule1 Rule3 Rule1 Rule2 O Rute4 Rulet Rule1. Rule6.Rule3,RuleRiez D. QUESTION 9 Which of the four languages represents the Turing Machine with instructions (0,a,a,R,0) (0b,b,R,1) (1b,b,R,1) (1cc,R2) (2,c,c,R,2) (2,A AS,Halt) OAb, where n.m.k 0 O B cwhere n >0 O C a bc, where nmk>-0 a"be , where n>0 O D