Excercise 4. (Regular languages and their automata) Consider the language L over the alphabet E= = {0, 1, 2, 3} where L = {w E L* : sum of digits of w = 4k +1 for some k N}. For instance, the word 32013 L as 3+2+0+1+3=9=4.2+1 but 3210 & L since 3+2+1+0= 6 =4.1+2. Design a deterministic finite automaton that accepts L. (4 Points)