1. Convert the following grammar to CNF. Assume S to be the start symbol and T={a,b,c) aPSale Q - SbS|P|bb R - CT S - PSQ 2. Construct Turing machine for the following grammar. Identify the final state and atleast one rejection state. L={p"q"r"s":n> = 1} over {={p,q,r,s}