1.Consider the following grammar: SaSbbSaSS Derive abbabaabbaba. Describe in English what kind of strings this grammar generates. 2.Write a regular expression to denote the set of strings that start with aba and ends with bab, and create/define a finite automaton by drawing a transition diagram to accept this set of strings. 3.Define a context-free grammar to generate the language L={anbnn is in {0,1,2,}}. 4.Consider the following grammar: S01S0 Is the language generated by this grammar regular? If it is, define a regular expression to denote the set of strings generated by this grammar, and also define a finite automaton to accept this set of strings. 5.Why is it needed to have finite automata in the mechanism of identifying tokens? 6.Give one example which is a context-free grammar and not a regular grammar