I think the problem with your answer to #6 is the definition of "code". If code means "a bit sequence representing a character", your answer is correct. If code means "result of the compression", D is true, if all k characters are distinct, k is a power of two, and the original code already used only ld(k) bits. In this case, you also have a full tree (if that means what I think), leading to answer E.)