P$6(20$ points$)$: 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: z$1$ z$0$ w$2$ w$1$ w$0.$ Answer the following questions:A$.$ What is the minimum number of state variables that can be usedto implement this FSM$?$ B$.$ What is the minimum number of TFFs that can be used toimplement this FSM$?2$Cpr E $281$ Synchronous Sequential HW$10$Circuits ELECTRICAL AND COMPUTER Assigned: Week $13$ENGINEERING IOWA STATE UNIVERSITYC. How many total state transitions exist in this FSM$?$ D$.$ Suppose that input X were always connected to ground. Draw thenew state diagram $($hint: the reset state is always reachable$).$ Howmany states and state transitions would be removed $($note: a statetransition is removed if its beginning state or its end state areremoved$)?$ E$.$ Suppose instead that input Y were always connected to ground.Draw the new state diagram. How many states and statetransitions would be removed? F$.$ What two circuits implemented separately would implement this$32-$state FSM$?$ Why? $($Hint: What FSM did the $32-$state FSMreduce to in step D$?)$