Horatio Hopeful has a favorite block code with a minimum distance (dmin) of 13. a) How many errors in a block can he guarantee that he can correct?

b) If he does not try to correct any, what is the largest number of erroneous bit he can be certain to detect?

c) Henrietta Hopeful, in a fit of jealous rage, erased all the bits containing digits of the phone number of his Aunt Hysteria Hopeful from his contact list, but no other bits. Horatio is confident that he correctly remembers all but 3 digits of the phone number. Given that the bytes containing the phone number are all inside one block of his favored code, is it possible for him to recover the missing digits? Explain your answer.