Exercise $2($Trees$)$ Task: EXERCISE $($a$)$: Given the tree structure below, identify the following: $$ Root of the tree $$ Leaf nodes $$ Siblings of node $12$ Ancestor nodes of node containing $19$ Descendants of node $72$ Height of the tree $$ Level of node $54$ EXERCISE $($b$)$: Given the below tree structure, write down the ordering of the nodes when traversed using each of the four types of traversal algorithms $($Preorder$,$ In$-$order, Postorder, Level$-$order$)$ Guideline: a$)$ Trees In Computer Science, a Tree is an abstract data type representing a hierarchical structure. This is a more constrained version of another structure called a graph. A graph is a collection of nodes $($usually called vertices$)$ and a collection of links $($usually called edges$)$ between them. A tree str