Construct FA to accept the set L of all strings over {0,1} ending with 010.

Construct PDA to accept the set L of all strings over {0,1} ending with 010.

Construct TM to accept the set L of all strings over {0,1} ending with 010.

Construct a TM that accepts the language 01* + 10*.

Construct a PDA  A equivalent to the following CFG : 

S --> 0BB , B --> 0S|1S|0

Test whether 010⁴ is in N(A).