2. Construct Turing machine for the following grammar. Identify the final state and atleast one rejection state. L={p"q","s":n>=1} over [={p,q,r,s}