Consider the following context-free grammar: S rightarrow SS, S rightarrow (S). S rightarrow (), S rightarrow [s]. Derive the string: []([])[()[]][]. Show each step. How many strings can this grammar derive? Consider the following grammar: S rightarrow AB, A rightarrow aA | epsilon, B rightarrow bB | epsilon. Derive aaabbb from the grammar rules. Show each step. This is a regular grammar. Define a regular expression to denote the set of strings generated by this grammar, and also draw (define) an FA to accept this set. How many strings can this grammar generate