Please solve with all required steps

A context-free grammar G-(, V, P, ) is called linear in each production at most one rhlocoan cri a te eu dear dapavak tam A language is called linear if there exists a linear grammar G such that L= L(G). For instance L = { anb" | n20 } is linear since the below grammar that generates it is linear Let L be any linear language not containing . Show that there exists a grammar G-(E, V, P, ) all of whose productions have one of the forms A Ba, where a e , A,B e T, such that L-L(G)