For the grammar G with the productions: E -> E a T | T T -> T m FF F -> (E) | X Give a CNF G' such that L(G') = L(G) \ {} (remember: CNF allows only productions with the form "X -> Y Z" or "X -> a")