Shown below is a FSM with 32 states. The two inputs are X and Y, in this order (that is, from state A, X-0 and Y=1 leads to state B). Note that the arrows which extend off of the sides wrap around to the top to complete the pattern (that is, from state MM, input 10 goes to state E, and input 11 goes to state F). Input 01 always goes to the state on the right, 10 to the state beneath, and 11 downwards and to the right. The five output bits are, in order from most to least significant for the output integers: zi zo w2 wi wwo. Answer the following questions: 14 ot or EF 20 10 A: What is the mninimum number of state variables that can be used to implement this FSM? B: What is the minimum number of TFFs that can be used to implement this FSM? C: How many total state transitions exist in this F SM? D: Suppose that input X were always connected to ground. Draw the new state diagram (hint: the reset state is always reachable). How many states and state transitions would be removed (note: a state transition is removed if its beginning state or its end state are removed)? E: Suppose instead that input Y were always connected to ground. Draw the new state diagram. How many states and state transitions would be removed? F: What two circuits implemented separately would implement this 32- state FSM? Why? (Hint: What FSM did the 32-state F SM reduce to in step D?)