Select all the statements below which are true: Each regular language is accepted by some npda. Each context-free language is accepted by some npda. npda's and dpda'a are equivalent. The language L = {ww^R: w element {a, b}*} is accepted by some npda. A npda has at most one transition for any combination of input symbol and stack symbol. dpda's can have lambda - transitions. Let sigma = {a, b, c}. The language L = {a^n b^n c^n: n > 0} is a context-free language. A dpda M can contain the transitions delta (q, c, a) = {{q1, lambda)} and delta (q, lambda, a) = {(q2, aa)}