Answers

Q1: All inputs that end in 1 will be accepted by Finite State Machine M1.

Q2:

Q3: We have never found a way to prove it.

Q4: Not all mathematics is decidable. The Famous Question " The Goldbach Conjecture" highlights such a problem. The Turing's Halting problem proved that not all problems are solvable. Some algorithms simply don't exist.