An early code used in radio transmission involved using 5-bit codewords that always contain exactly two 1s and three zeros (in different orders). a) List all valid codewords. b) Suppose each valid codeword represents a k-bit data symbol. How many bits per data symbol can be supported (maximum value of k) in this scheme? c) How can the receiver check for errors in this scheme? d) How many error bits in a codeword can be detected by this scheme? e) The codeword 11000 has been transmitted. If the probability of bit error is 0.001, calculate the probability that this codeword is received with an error that could not be detected. An early code used in radio transmission involved using 5-bit codewords that always contain exactly two 1s and three zeros (in different orders). a) List all valid codewords. b) Suppose each valid codeword represents a k-bit data symbol. How many bits per data symbol can be supported (maximum value of k) in this scheme? c) How can the receiver check for errors in this scheme? d) How many error bits in a codeword can be detected by this scheme? e) The codeword 11000 has been transmitted. If the probability of bit error is 0.001, calculate the probability that this codeword is received with an error that could not be detected