Suppose a language L is accepted by a PDA M. Define a construction of a PDA M that accepts L such that M has at most 2 states. (Hint: build a PDA that uses the stack to do a left-most grammar derivation.)

Please define the constructions with a drawing of the PDA.