QUESTION 3 Consider the following final state PDA, where state 0 is the initial state and X is the initial stack symbol, state 3 is the final state and Ais empty string (0, a, X, push(a), 0) (Rule 1) (0, a, a, push(a). 0) (Rule 2) (0, b, a, pop,1 (Rule 3) (1, ?, a, pop, 2) (Rule 4) (2, ^, a, pop, 1) (Rule 5) (2, ?, X, nop, 3) (Rule 6) 0,A X, nop, 3)(Rule 7) In order to show whether input string aaaaaabb belongs to this PDA, Which of the following PDA computation sequence of the PDA instruction should be applied to the string? O A Rule1, Rule1, Rule2, Rule2,Rule2, Rule2, Rule3, Rule4, Rule5, Rule4, Rule 6 ? B. Rule 1, Rulet, Rule1, Rule1 ,Rule 1, Rule 1, Rule3, Rule4, RuleS. Ruled, Rule 6 O C. Rule1, Rule2, Rule2, Rule2,Rule2,Rule3, Rule4, Rule5, Rule4, Rule 6 O D Rule1, Rule2, Rule2, Rule2,Rule2, Rule2, Rule3, Rule4, Rule5, Rule4, Rule 6