12. Answer True or False for the following questions a) Deterministic Finite Automata (DFA) can be used to depict a set of languages that cannot be depicted using an Vondeterministic Finite Automata (NFA). (True or False) b) DFA and NFA both can depict exactly same set of languages. (True or False) c) DFA can have al most one final state. (True or False) d) NFA can have at most one start state. (True or False) e) Every regular expression can be written using context-free grammar (CTG). (True or False) Draw a parse tree for the string bbabbbb using the Contex Free Grammar: SbSbbA AaAa 13. Draw a parse tree for : - + vb2 - 4ac 2a