2. 3-bit messages (followed by two zeros to flush the shift registers) are input to the encoder described by the generator transfer-function matrix G(D) = [1+ D + D 1+ D]] A received (noisy word) sequence for one message is 10 01 10 11 00 Use a decoding trellis and choose the path with the minimum Hamming distance. Find the decoder output.