Let M = (Q,,,,q0,Z0,A) be a PDA that accepts L whenever M, after

reading a word, is in either an accepting state or has an empty stack.

(a) Define a construction for a PDA that accepts L by empty stack alone.

(b) Define a construction for a PDA that accepts L by final state alone.

Please define the constructions with a drawing of the PDA.