For a 10-bit data word (not including error check bits), determine the hamming check bits that must be inserted to detect and correct a single error. how many parity bits must be generated to detect and correct a single bit error in a word of this size? show the data word, where the parity bits are inserted, and how they are calculated as a boolean function of the bits in the word. for a data word of $238, calculate the parity bits. show how an error in bit 4 would be detected by the calculation of the check bits. given the number of parity/check bits you calculated and the size of the data word, could an additional data bit be included, and error detection and correction still be provided for a single bit error?