Let $M$ be a nondeterministic finite automata with $=\{a,b\}$

M

The machines M$1,$ M$2$ and M$3$ below are deterministic finite automata. For each machine

decide whether or not the machine accepts $L(M).$

M$1$

$L(M1)=L(M).$

M$2$

$L(M2)=L(M).$

M$3$

$L(M3)=L(M)$