Please answer question b) . Thank you

Given the following set of character-probability pairs: (2, 0, 2), (2, 0, 2), (0, 0, ), (, 0, ), (, 0, 2) (The probability associated with each character is the probability accurring in the text to be compressed.) Build a Haffman tree for this character set. Fill in the following table to show the leaves queue (S) and the trees queue (T) be the end of each step. Assume the enqueue, dequeue, pick, creating a leaf mode, creating a new tree out of two subtrees, and picking the minimum of two probabilities all take unit time. Ignore the time for all other operations. How many units of time did it take in all to build your tree? Show your work