Given the following set of character-probability pairs.

(C, 0.05), (D, 0.01), (R, 0.12), ( S, 0.13), (E, 0.6)

Show the final huffman tree

How many total units of time did it take to build this tree. Count only enque, dequeue, creating a leaf node, creating a new tree out of 2 subtrees, and comparing 2 probabilities - each is unit time. All queues are initially empty and must be empty at the end