What is the grammar for the language of the following machine? (explain your answer) What is the NFA of the following regular grammars? i. s rightarrow abs | as | ba ii. s rightarrow Lambda | c | as | abs Research about Context Free Languages. Make sure to provide the following information in your answer to this question: (a) How Context Free languages are different from Regular languages. (b) What are the automata accepting those languages and how they are different from DFA and NFA. (c) How the grammar of Context Free Languages are different from those in Regular languages