Consider a finite state machine(FSM) that recognizes the pattern 1111. The input to the FSM is a sequence of binary bits, one after the other. When the FSM receives 1111 as inputs in successive bits, it should output 1. Otherwise, the output should be 00. For example FSM output: 00011000010000 1Draw the state diagram for this FSM and desacibe what each state represents 2) How many bits arerequired to represent all the states? ) Draw the output truth table forthis FSM (e g if you need 2 bits (01, Q0) to represent all the states, then the truth table has 3 columns (Q1, Q0loutput)) 02 Q1 Q0 output Draw the next state logic truth table for this FSM(e.g ifyou need 2 bits ( to represent all the states, then the truth table has 5 colu mns (input, Q1, Q0Q1 1, 0) Initial State Next State input 2 Q1 Q2