Question 8 Let's let Ig(x) mean the log base 2 of x. We said that the number of checkbits c for d data bits is approximately Ig(d). For the first few values of c, figure out how many data bits there...

Extracted text: Question 8 Let's let Ig(x) mean the log base 2 of x. We said that the number of checkbits c for d data bits is approximately Ig(d). For the first few values of c, figure out how many data bits there could be and what the total number of bits b = d+ c is. Look for patterns involving powers of 2 or Ig(x). Based on this, what can you conclude? For d> 4, c = ceiling(lg(d) For d> 4, c = Ig(d) d = b - c = b - Ig(b+1) None of the above.