Find the hamming distance for the following pairs of codewords a. d(011010, 111011) b. d(000111, 111000) c. d(111011, 110111) d. d(101010, 100101) For the 2B/5B block code defined below, using the Hamming distance criteria, show that the code can be used to correct single bit errors incurred during data transmission. 01 01011 1010101 A data frame consists of 100 bits. If the BER is 103, what is the probability that the received frame will contain at least 1 error? (Hint: The BER is the probability that a bit is in error)