chap binary trees what will the huffman coding tree look like for set of sixteen characters all with equal weightwhat is the average code length for letter in this casehow does this differ from the smallest possible fixed length code for sixteen characters set of characters with varying weights is assigned huffman codes if one of the characters is assigned code then(adescribe all codes that cannot have been assigned (bdescribe all codes that must have been assigned assume that sample alphabet has the following weightsletter frequency (afor this alphabetwhat is the worst-case number of bits required by the huffman code for string of letterswhat string(shave the worstcase performance(bfor this alphabetwhat is the best-case number of bits required by the huffman code for string of letterswhat string(shave the bestcase performance(cwhat is the average number of bits required by character using the huffman code for this alphabet you must keep track of some data your options are( linked-list maintained in sorted order ( linked-list of unsorted records ( binary search tree ( an array-based list maintained in sorted order ( an array-based list of unsorted records for each of the following scenarioswhich of these choices would be bestexplain your answer (athe records are guaranteed to arrive already sorted from lowest to highest ( whenever record is insertedits key value will always be greater than that of the last record inserteda total of inserts will be interspersed with searches (bthe records arrive with values having uniform random distribution (so the bst is likely to be well balanced , , insertions are performedfollowed by searches (cthe records arrive with values having uniform random distribution (so the bst is likely to be well balanced insertions are interspersed with searches