Let G= ({S, A, B, C},{a, b}, R, S), which is a context-free grammar with the rules R given by:

SABa

SCbB

ACaA

Aa

BS

Bb

CBb

CA

Give an equivalent grammar G in Chomsky Normal Form, which describes the same language L(G) =L(G)