A grammar is defined by the following sets:

G[Z] = {(Z, B), (a, b), P, Z} where P consists of the following productions:

R1: Z ::= Zb|Bb

R2: B ::= Ba|a

5a. What type of grammar is this? [01]

5b. Show that aaabb is a valid string of the language described by G[Z]. [03]

5c. Show that aabb is a valid string of the language described by G[Z]. [03]

5d. Show that aabbb is a valid string of the language described by G[Z]. [03]

5e. Propose a generic expression for the language of G[Z]. [02]

5f. Propose a finite state machine (FSM) for G[Z]. [04]

5g. Is the FSM of 5f deterministic or non-deterministic? Could it be used as a syntax analyzer? Defend your answer. [04]