Question 2: Give a deterministic automata for the following languages. The Alphabet is = { 0 , 1 }

1. 0^m 1ⁿ . Namely, the strings that start with some number m (it may be that m = 0) of 0 and then some another number n ( n may be zero) of 1.

2. The set of all strings with 3 consecutive 0

3. The Language so that every 3 consecutive characters have at least one 0.