Consider the following binary tree: 1. How many levels the binary tree has? 2. What are the nodes of the tree? 3. What are the edges of the tree? 4. What is the height of node 3 ? 5. What are the ancestors of node 4? 6. What are the proper descendants of node 6 ? 7. What is the degree of node 7 ? 8. Re-draw the tree after inserting node 5? 9. Re-draw the original tree after deleting node 3 ? 10. What is the output if we perform the flowing on the tree: A. breadth-first traversal B. depth-first traversal (post-order) C. depth-first traversal (in-order) D. depth-first traversal (post-order)