Answer T or F regarding Machine Automata.

Every context-free language has an unambiguous context-free grammar. () Every deterministic machine is a non-deterministic machine. (r)The language consisting of all base 2 numerals for integer powers of 2 is regular. There is a DPDA that accepts the language of all palindromes over the binary alphabet (0,1 Let L be the language over fa, b,c consisting of all strings which have more a's than b's and more b's than e's. There is some PDA that accepts L (u)The language (a'bic* |j2ik is context-free