3. First, build a HCTree based on the frequency of chars in a file: a(3), b(5), c(4), d(26), e(12). You should use the following rules when building your HCTree: HCNode with smaller count will have...

Extracted text: 3. First, build a HCTree based on the frequency of chars in a file: a(3), b(5), c(4), d(26), e(12). You should use the following rules when building your HCTree: HCNode with smaller count will have higher priority, and if the count is the same, then the HCNode with the larger ASCII value symbol will have higher priority. When popping two highest priority nodes from PQ, the higher priority node will be the 'co' child of the new parent HCNode. The symbol of any parent node should be taken from its 'cO' child. Your HCTree drawing won't be graded, but is required to answer the following question List the encoding bits of all the symbols (a, b, c, d, e) based on your HCTree a d b