I got the first part correct, which asked to build a Huffman tree. I wanted to know how to calculate the total units of time, which is the 2nd question. please show steps when to enqueue, dequeue, build a sub tree! It seems the answer is between 29-32. thanks in advance!

(a) Given the following set of character-probability pairs: (C,0.05). (D.0.1). (R0.12). (S.0.13), (E,0.6) Show the final Huffman tree (you don't need to show any of the steps of the tree build process). Svi E: 0 o.4 D 1o1 2 110 .IS 0.25 D R S (b) How many total units of time did it take to build this tree? Count ONLY enqueue, dequeue, creating a leaf node, creating a new tree out of two subtrees, and comparing two probabilities each is unit time. (Ignore all other operations) All queues are initially empty, and must be empty when the process is completed