Question

) From the perspective of operation complexity (bigo), explain why a min-heap is superior to a sorted array for maintaining and providing the minimum weights for building the Huffman tree: Variable-length codes will generate a superior compression ratio vs. fixed-length codes only if the characters in the file exhibit which characteristic? What is the minimum count of bits required for each fixed-length codeword for an alphabet consisting alphabet? of the space character plus the set of decimal numerals and both cases of the English

Please answer the circled questions. that would be the huge favor. thanks