7. Consider a Cyclic Redundancy Check (CRC) code with generator polynomial: g(x) = x3 + x2 + 1.

i. Presume the codeword length is 8, what fraction of errors is undetectable by this code (what is FUE of this code)?

ii. Presume the codeword length is 8. What fraction of error bursts of length 6 is undetectable by this code (what is FUE of this code when L = 6?)