Consider the following values for the following questions: 87, 11, 34, 45, 123, 34, 66, 107 10. What are the two constraints for a binary tree to be a MaxHeap tree? 11. Construct a max heap tree with all the values. List all steps. 12. Insert 99 to the above tree. List all steps. 13. Perform delete operation, what value does it give? 14. After the above delete operation, how does the tree change? List all steps Consider the following values for the following questions: 12,13, 14, 35, 44, 55, 75, 82, 89, 91, 199 15. Construct a balanced binary search tree for the above sorted values? List all steps 16. Insert 25 in the above tree. How does the tree change? List all steps. 17. Delete 89 in the above tree. How does the tree change? List all steps. 18. Delete 12 in the above tree. How does the tree change? List all steps.