Table 1 shows the list of codewords for a Hamming-distance based correction scheme. Data Codeword 000 011011 001 100110 010 100111 011 010000 100 111100 101 001010 110 100101 111 001011 Table Hoving-based FEC Note: In a receiver using Hamming-distance based scheme, the received codeword is compared to the set of valid codewords using Hamming-distance metric. The valid codeword from Table1 closes to the received codeword is, subsequently, assumed to be the codeword actually sent.) For the following two cases, explain the steps taken by the receiver - showing any calculations where necessary - and summarize the respective outcome The data 101 is to be sent from transmitter to receiver. The 1st bit transmitted is in error. Steps taken by receiver: (a) Codeword received by receiver.? (b) Error detected by receiver: YES or NO (c) Data received: ? (d) Is the correct data received? YES or NO Table 1 shows the list of codewords for a Hamming-distance based correction scheme. Data Codeword 000 011011 001 100110 010 100111 011 010000 100 111100 101 001010 110 100101 111 001011 Table Hoving-based FEC Note: In a receiver using Hamming-distance based scheme, the received codeword is compared to the set of valid codewords using Hamming-distance metric. The valid codeword from Table1 closes to the received codeword is, subsequently, assumed to be the codeword actually sent.) For the following two cases, explain the steps taken by the receiver - showing any calculations where necessary - and summarize the respective outcome The data 101 is to be sent from transmitter to receiver. The 1st bit transmitted is in error. Steps taken by receiver: (a) Codeword received by receiver.? (b) Error detected by receiver: YES or NO (c) Data received: ? (d) Is the correct data received? YES or NO