I need detailed stages to understand

1. Draw an execution tree for the getSibling() routine for the following tree of data (using your code). Look for the object holding "tttt". Show all function calls and relevant information at each call. (Recall the getSibling() is written for a general binary tree, not a binary search tree.) iii not tttt eee r and jj pp sssss ooo ff m y z 2. Use Huffman coding to encode these symbols with given frequencies: a: 0.10 b: 0.25 c: 0.05 d:0.15 e: 0.30 f: 0.07 g:0.08 3. Build (draw) a heap (smallest value at root) by inserting one item at a time with the values: 1520348109514225 4. Build (draw) a heap (smallest value at root) using the linear algorithm with the values: 1028620351241015