of the following operations applied on the binary search tree below. a) Delete node 4. b) Based

of the following operations applied on the binary search tree below. a) Delete node 4. b) Based on output from step a), delete node 7. c) Based on output from step b), delete node 18. Note: S trictly speaking, node i in the question should be interpreted as “a node that is represented by its key value of i ”. Exercise A2 (1 5 points) Follow the B – TREE – INSERT procedure described in Chapter 18, show step – by – step output of each of the following op erations applied on the B – tree below. Note that the B – tee has a minimum degree t =3 and the values inside each node show the key values stored in that node. a) Insert key 6. b) Based on output from step a), insert key 37. c) Based on output from step b), inse rt key 34. d) Based on output from step c), insert key 45.