Q3: Consider the below grammar and identify if the strings babb, bbbabb, bbaaaaabc, aaaaaa are derivable. Show your derivation. The grammar goes as follows:

< > < > < >

< > < > |

< >

Q4: Write a grammar for the language that includes all strings containing n copies of alphabet a, followed by n+1 copies of the alphabet b. Assume > 0. Upon completion of the grammar definition, draw the parse tree for the sentences abb and aabbb along with the derivations.

Q5: Consider the identifier definition of a hypothetical programming as follows: strings of consist of letters and numbers, and they must begin with a letter.