a. A particular finite state machine is to be implemented using T flip-flops, but we only have J-K flip-flops in our inventory of digital parts. Show how to implement a T flip-flop starting with a J-K flip-flop.
b. A state diagram for a particular finite state machine requires a total of 130 states. What is the minimum number of binary digits required to encode these states uniquely. This is actually the minimum number of flip-flops that can be used to implement this finite state machine.