6. Consider a code set with 4 codewords: [1 1 1 1 1 1 1 1],[00000000], [1 1 1 1 0000], [00001 1 1 1]. i) What is the Hamming distance between the 1st and 2d codewords? ii) What is the Hamming distance for this code set? iii) How many bit errors will this code set be able to detect? iv) How many bit errors will this code set be able to correct? (2)