Formally define a finite automaton as a 5-tuple for the following problem. Give a table for the transition function . The input is a string of digits from {0, 1, 2, 3}. The automaton should accept such a string if the sum of its digits is 1 modulo 4.