Design an automatic machine that has the function of a modulo-3 counter and can count both forwards and backwards. The machine is to be implemented with two T flip-flops. The input line RWD determines the counting direction. (RWD = 0 forward / RWD = 1 backward) Create the automaton graph for the given problem. then Enter the machine table and the assignment of the I flip-flops of the modulo-3 counter. Note: The status names are the same as the output and can be binary coded. and Determine the optimized input function for both T flip-flops. Substitution table of the T flip-flop 0 QT 0 0 0 0111 101 20 TITO ZI ZD RWD ZI 0 0 0 0 0 0 1 0 011 10 10 O RWD TO: 0 RWD TIE Explain your answer briefly