3) Consider the binary tree of 11 nodes shown here. 0 a-9 pts) Determine the depth and height of all the nodes in the tree. b - 9 pts) Determine the heights of the left and sub trees of each internal node and decide whether the tree is height-balanced or not. 10 c-9pts) write down the pre-order and in-order traversal of the vertices in the binary tree. d-9 pts) Assuming that the node IDs to also represent the data stored at the nodes, transform the binary tree to a binary search tree without affecting the structure of the given binary tree. e - 4 pts) If the nodes are to be rearranged to form a binary tree of the smallest possible height, what would be such a height