From Strictly Right Linear Grammars to NFAs Translate the following striclty right linear grammar with starting variable A into a nondeterministic finite automaton (NFA): AaB AC BbC B lambda CB CB Cc 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 , , - variables: uppercase letters possibly followed by a number or primes, e.g. - the starting variable is