Please no Handwriting I have trouble understanding it most of the time.

4. [5 Points] Show that every CF grammar G = (V,T,S,P) can be converted into an equivalent CFG in which every production is of the form A xBC or A X, where r TU {} and A, B, and C are variables. 4. [5 Points] Show that every CF grammar G = (V,T,S,P) can be converted into an equivalent CFG in which every production is of the form A xBC or A X, where r TU {} and A, B, and C are variables