(a) For the frequencies given below, construct a Huffman Tree and compute Average Code Length. {A:5, B:9, C:12, D:13, E:16, F:45} (b) With the help…

(a) For the frequencies given below, construct a Huffman Tree and compute Average Code Length. {A:5, B:9, C:12, D:13, E:16, F:45}

(b) With the help of a stack, convert the following Infix Expression to Postfix Expression. Show stack contents at each step. (A+B) * (C-D) / E

(c) For the following values, show step-by-step operations of the quick sort Algorithm. [24, 9, 29, 14, 19, 27]