Given the following ten-bit input: 1101010110 What OUTPUT is the above statemachine going to generate? Keep in mind it will generate ten bits in total, and the first bit to go in is the left most, i.e., first input is 1 , then 1 , then 0 , then 1, Note that the output sequence is b1b2 b3 b4 b5 b6 b7 b8 b9 b10, where b1 is the first bit output corresponding to the first input bit in the given sequence. b1 b2 b3 b4 b5 b6 b7 Use this State Machine Diagram for the following questions. You'll be creating a truth table, K-Maps, and functional specifications for the above state machine. Use the following encoding: State 0: 00 State 1:01 State 2:10 State 3:11 Notes: The two state bits are called S1 and SO in the following questions. For example, in state 10 we have that S1=1 and S0=0. The next state bits are indicated with : For example, 51 ' is the "next state bit value for $1" The complement of a variable is indicated with !. For example !A indicates "complement of A " Notes: The two state bits are called S1 and SO in the following questions. For example, in state 10 we have that S1=1 and SO=0. The next state bits are indicated with '. For example, S1 ' is the "next state bit value for S1". The complement of a variable is indicated with !. For example !A indicates "complement of A" You should name the input variable as A and the output variable as Y