Translate the following grammar with starting variable A into a strictly right linear grammar that generates the same language: A -> aabB B -> cbA A -> lambda You may introduce fresh variables, but do not rename the original variables! Grammars have the following syntax: rules are written left right write lambda 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. S. X, X2,Y'.... the starting variable is s