Given the following list of data : 20, 15, 18, 40, 60, 30, 7, 35, 50 a) Draw a binary tree. b) Based on the tree that you have drawn in Question 4(a) answer ALL of the following questions: i. Write PostOrder Traversal. ii. Write all the descendants of node with data 40.

iii. Redraw the tree when node with data 40 is being deleted. iv. What is the height of the tree based on the new redrawn tree in Question 4(b)(iii)? v. Which node will be the root node if the current root node is deleted based on the new redrawn tree in Question 4(b)(iii)?