What is an optimal Huffman code for the following set of frequencies, based on the first $8$ Fibonacci numbers?

a:$1$ b:$1$ c:$2$ d:$3$ e:$5$ f:$8$ g:$13$ h:$21$

Can you generalize your answer to find the optimal code when the frequencies are the first $n$ Fibonacci numbers?