Please answer the following Sub questions:

A:

B:

C:

From Strictly Right Linear Grammars to NFAs Translate the following striclty right linear grammar with starting variable A into a nondeterministic finite automaton (NFA): AB AaC Ab A lambda BA BcC CbA Please use the name the states with names of variable (except for the accepting state). You may introduce fresh variables, but do not rename the original variables! Grammars have the following syntax: - rules are written - write or for an empty right-hand side - terminals: lowercase letters, e.g. a , b , .. - the starting variable is S Translate the following grammar with starting variable A into a strictly right linear grammar that generates the same language: Aabaab AcbC BC BbA Bbaa C abbA C lambda You may introduce fresh variables, but do not rename the original variables! Grammars have the following syntax: - rules are written - write or for an empty right-hand side - terminals: lowercase letters, e.g. a ,b, - the starting variable is s