Please break down the steps for this:

a)Consider the following grammar:

S a S b | b S a | SS

Derive abbabaabbaba. Describe in English what kind of strings this grammar generates.

b)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.

c)Define a context-free grammar to generate the language L = {aⁿ bⁿ | n is in {0, 1, 2, }}.

d)Consider the following grammar:

S 01S | 0

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.

e)Why is it needed to have finite automata in the mechanism of identifying tokens?

f)Give one example which is a context-free grammar and not a regular grammar.