Follow the TREE-DELETE procedure described in Chapter 12, show step-by-step output of each of the following operations applied on the binary search tree below.

a) Delete node 3.

b) Based on output from step a), delete node 7.

c) Based on output from step b), delete node 18.

d) Based on output from step c), delete node 19.

Note: Strictly speaking, node i in the question should be interpreted as a node that is represented by its key value of i.