4. Follow the TREE-DELETE procedure described in the textbook, show step-by-step output of each of the following operations applied on the binary search tree below. [15 points] a) Delete node 7. b) Based on output from step a), insert node 19. c) Based on output from step b), delete node 6 d) Based on output from step c), insert node 18. e) Based on output from step d), delete node 17. Note aode i in the questions should
OR
OR