Q. In which of the stated below is the following statement true? “For every non-deterministic machine M1, there exists as equivalent deterministic machine M2 recognizing the same language.”

• (A) m1 is a non-deterministic finite automata
• (B) m1 is a non-deterministic push-down automata
• (C) m1 is a non-deterministic turing machine
• (D) for no machine m1 use the above statement true