Consider the transition diagram of a PDA given below with input alphabet Σ = {a, b} and stack alphabet Γ = {X , Z}. Z is the initial stack symbol. Let L denote the language accepted by the PDA.
Which one of the following is TRUE?
(A) L = {anbnIn≥0} and is not accepted by any finite automata
(B) L= {an≥0} ∪ {anbnIn≥0} and is not accepted by any deterministic PDA
(C) L is not accepted by any Turing machine that halts on every input
(D) L = {anIn≥0} U (anbnIn≥0) and is deterministic context-free
