Draw DFAs that decide the following languages. You do not need to prove that they are correct. (

a) (3 marks) Over alphabet {0, 1}, L = {w | w has length at least 3 and its third symbol is a 1}

(b) (3 marks) Over alphabet {0, 1, 2}, L = {w | a 2 never appears anywhere to the right of a 1 in w}

(c) (3 marks) Over alphabet {0, 1}, L = {w | w = 0ⁿ1^m where n, m 0 and n + m is divisible by 3}