Exercise on Red Black Trees Determine for each of the trees given below whether it is a Red Black Tree or NOT Question 2 Show the step-by-step result of the insertion of the nodes below to make a Red Black Tree: 13,46,31,59,88,9 Suppose figure below is showing an AVL tree: Figure 3 Show the result of each operation (insertion/deletion) by showing all working associated at each level to hold the AVL properties. [NOTE: Refer to the original tree above, before answering each question (a) through (d). In other words, each question is INDEPENDENT. a. Insert 75 to the original tree (2 marks) b. Delete 40 from the original tree ( 3 marks) c. Insert 42 to the original tree ( 2 marks) d. Delete 32 from the original tree