Given n + 1 symbols x1, x2, . . . , xn, xn+1 appearing 1, f1, f2, . . . , fn times in a symbol string, respectively, where fj is the j th Fibonacci number, what is the maximum number of bits used to encode a symbol when all possible tie-breaking selections are considered at each stage of the Huffman coding algorithm?