An alphabet contains letters A, B, C, D, E, F. The frequencies of the letters are 35%, 20%, 15%, 15%, 8%, and 7%. We know that the Human algorithm always outputs an optimal prefix-free code. However, this code is not always unique (obviously we can, e.g., switch 0’s with 1’s and get a different code – but, for some inputs, there are two optimal prefix-free codes that are significantly different). For the purposes of this exercise, we consider two Human codes to be different if there exists a letter for which one of the codes assigns a shorter codeword than the other code.