generalize your answer of 4(a) to comment on the optimal code for each character in this file, if the given file had ‘n’ distinct characters whose corresponding frequencies were represented by the first ‘n’ terms of the fibonacci series.