4.) According to the following look-up table for the encoder; a.) Draw the state diagram b.) By drawing the trellis diagram of the code, find out which information sequence the Viterbi Algorithm will decide if the y=(111101110101000010) noisy sequence is taken. (The encoder will be assumed in an all-zero state at start and end). Input Bit 1, 0 1 0 1 0 Input State Si S2 S3 0 0 0 0 0 0 0 0 1 0 0 1 0 1 0 0 1 0 0 1 1 0 1 1 1 0 0 1 0 0 1 0 1 1 0 1 1 1 0 1 1 0 1 1 1 1 1 1 Output Bits 0 02 0 0 1 1 1 1 0 0 1 0 0 1 0 1 0 1 1 0 0 1 Output State Si S2 S3 0 0 0 1 0 0 0 0 0 1 0 0 0 0 1 1 0 1 0 0 1 1 0 1 0 1 0 1 1 0 0 1 0 1 1 0 0 1 1 1 1 1 0 1 1 1 1 1 1 0 1 0 1 0 1 0 0 1 0 1 1 0 0 1 1 0 0 1 1 4.) According to the following look-up table for the encoder; a.) Draw the state diagram b.) By drawing the trellis diagram of the code, find out which information sequence the Viterbi Algorithm will decide if the y=(111101110101000010) noisy sequence is taken. (The encoder will be assumed in an all-zero state at start and end). Input Bit 1, 0 1 0 1 0 Input State Si S2 S3 0 0 0 0 0 0 0 0 1 0 0 1 0 1 0 0 1 0 0 1 1 0 1 1 1 0 0 1 0 0 1 0 1 1 0 1 1 1 0 1 1 0 1 1 1 1 1 1 Output Bits 0 02 0 0 1 1 1 1 0 0 1 0 0 1 0 1 0 1 1 0 0 1 Output State Si S2 S3 0 0 0 1 0 0 0 0 0 1 0 0 0 0 1 1 0 1 0 0 1 1 0 1 0 1 0 1 1 0 0 1 0 1 1 0 0 1 1 1 1 1 0 1 1 1 1 1 1 0 1 0 1 0 1 0 0 1 0 1 1 0 0 1 1 0 0 1 1