need help with the entire Q4 ?

a regular exp us you low see, is a form tG be the grammar em 6.3.1 to build an NFA M that accepts L(G). a) Use Theorem ) 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) d) Construct a regular grammar from M' that generates L(M) e) Give a regular expression for L(G)