1 Finite State Automaton (FSA) (a) Specify a DFA using a transition diagram and a formal FSA specifica- tion (see lecture 2) that recognizes the following languag All strings of 0's and 1's that, when interpreted as a binary number are divisible by 4. In other words, value(binary number) modulo 4- (b) Specify a DFA using a transition diagram and a formal FSA specifica- tion (see lecture 2) that recognizes the following languag: its value modulo 41