kenneth rosen [closed]

Question

 Given n+1 symbols x₁,x₂,...,x_n,x_n+1 appearing 1, f₁,f₂,...,f_n times in a symbol string, respectively, where f_j 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? 

 

in this question i take n=6

the the number of symbols should be n+1  i.e 7 (in this case ansewr is 8)or n i.e 6( in this case answer is 6)???