Computer science: reference Theory of Computation

implement this with:

$1-$ non$-$deterministic FA$,$

$2-$ pushdown automata,

$3-$ Turing machine.

You should have at least $5$ states in this problem and give at least $3$ of $5$ cases that your "machine" accepts.

Also,

$1-$ Describe the alphabet of this problem.

$2-$ Give a description of the states for this problem..

$3-$ Give a description of the start and accept states for this problem.