Q1-28 pts) Given the following binary tree: (a - 5 pts) Find the depth of all the leaf nodes of the tree (b- 5 pts) Find the height of all the internal nodes of the tree (c-8 pts) Determine whether the tree is height-balanced or not (d - 6 pts) If the nodes are to be rearranged, what is the minimum possible height of a binary tree of 12 nodes? (e - 4 pts) Would the binary tree of (d) be a complete binary tree? Show all the work. Use the space on the back side, if needed. 0 2 3 4 9 10 5 7 8 6