Hello I have an automata question could you help me?

4. (25 pts) Consider the grammar below and apply the following procedures using the algorithms discussed in class. (a) Eliminate any e productions. (b) Eliminate any unit productions in the resulting grammar (c) Eliminate any useless symbols in the resulting grammar (d) Put the resulting grammar into Chomsky Normal Form. (e) Is the resulting grammar ambiguous? If so, explain why. If not, show this with an example