Draw the state diagram of a finite automaton that recognizes the language of all strings over {0,1,2,3,4,5,6,7,8,9} that represent decimal numbers evenly divisible by 4 . Leading 0 's are allowed and the empty string should also be accepted.