1. Consider a binary search tree (BST) initially empty. 1.1 Insert keys 22, 11, 10, 2, 17, 19, 25, 24, 29, 14 into the tree in the indicated order. Draw the tree obtained after all the insertions. In the following paragraphs, consider the tree obtained as the "original" tree. 1.2 Remove key 11 from the original tree using the (Deletion by Merging) algorithm, choosing the option in which the removed node is replaced by its right child. Draw the obtained tree justifying the intermediate steps / reasoning. 1.3 Carry out a rotation to the left of 25 on the original tree around 22. Draw the tree obtained justifying the intermediate steps / reasoning