Answer the following three parts briefly. a) LG = {("G", "w") | G is a CFG and w belongs to the language of G}. Give a high level description of Turing Machine T which decides LG. b) For any Turing Machine, can the tape alphabet be same as input alphabet. Why or Why not. c) Can a Turing Machine contain just one single state? Why or Why not.