Select all the statements below which are true: Each non-regular language is accepted by some npda. Each context-free language is accepted by some dpda npda's and dpda'a are not equivalent. Let -{a, b, } . The language L Adpda Mcannot contain the transitions (q, c, a) dpda's can have -transitions. O {an bern : n, m > 0} is a context-free language. O {(a, )) and (q, , a) {(a,aa)) O The language L-{ wwR : w {a, b}* } is accepted by some dpda. A npda has at most one transition for any combination of input symbol and stack symbol