3. Gven the following regular grammar: 5+a5 | al | bK 1 b | al, J- bK | aJ. K-ak bK |A one can use the algorithm given in slide 21 of the notes "Regular Languages and Finite Automata- IV to construct...

Extracted text: 3. Gven the following regular grammar: 5+a5 | al | bK 1 b | al, J- bK | aJ. K-ak bK |A one can use the algorithm given in slide 21 of the notes "Regular Languages and Finite Automata- IV to construct an NFA to recognize the language of the given grammar. Fill out blanks in the following figure so that the resulting NDA would fulfil such a task, ie, would recognize the language of the gven grammar. శికయ