4. Let G be the grammar A aS |bA | b. a) Use Theorem 6.3.1 to build an NFA M that accepts L(G). b) Using the result of part (a), build a DFA M' that accepts L(G). c) Construct a regular grammar from M that generates L(M) onstruct a regular grammar from M that generates L(M). e) Give a regular expression for L(G)