1. Build a Finite Automaton to generate all strings of the form 1m0n1k, where k is greater or equal to 0, but m and n have to be greater than 0.

2. Build a Finite Automaton to generate all strings containing any amount of 1's followed by even number of 0's. Examples: 100, 1100, 111000000, etc.

3. Build a Finite Automaton with two states generating just one string.

4. Build a Finite Automata with two states generating infinitely many strings.

5.Build a Finite Automaton to generate all strings of the form 1^m0ⁿ, where m is divisible by 3 and n is divisible by 5.

Please answer these questions asap