Question 2 [25 Marks Analyse the given below Binary Search Tree and answer the following questions. A tree consists of a nonempty finite set of elements called nodes (vertices) and a finite set of directed edges or lines called branches that connect these nodes. Based on the original tree diagram in Figure 3, answer each question. 44 35 79 20 37 80 10 32 36 40 55 75 95 18 48 84 99 Figure 3 : Tree (a) Identify the siblings given in the above binary tree? [2 marks] (b) Traverse the tree and list the nodes via in-order, post-order, pre-order traversal with appropriate explanation. [9 Marks ] (c) Re-draw the tree if the root node is deleted. [4 Marks ] (d) Illustrate the steps to insert 25 into the binary tree based on the result of question (c) [10 Marks]