Please help with these questions! - Formal Language and Auto Theory:

Question 9 10 pts Select all the statements below which are true: Each context-free language is accepted by some npda. O Let {a, b, c} The language L = {a"bnc" : n 0} is a context free language. npda's and dpda'a are equivalent. The language accepted by some npda. A npda has at most one transition for any combination of input symbol and stack symbol. O dpda's can have -transitions. Each regular language is accepted by some npda A dpda M can contain the transitions (q, c, a) {(a , )) and 1, X)y and