Consider the following binary search tree. Remove key 13 from the tree and draw the resulting tree. Then remove the key 5 from this new tree and show the final tree

16. [6 marks] Consider the following binary search tree. Remove the key 13 from the tree and draw the resulting tree. Then remove the key 5 from this new tree and show the final tree (so in the final tree both keys, 13 and 5, have been removed). You must use the algorithms described in class for removing data from a binary search tree. 13) 4 21 17 18