do it quickly

Q4. write dry run for the given binary search tree, step by step apply the following operations (a to j) and show the tree after each operation. 63 6 35 80 33 40 68 . delete 25 delete 22 delete 33 delete 75 delete 19 b. d. f. h. e. add 32 delete 65 add 95 add 54 add 23 i. Note: After step (a), draw the tree again with node 25 removed. Then apply step (b) to this new tree obtained after step (a). Similarly apply step (e) to the new tree obtained after step (b)