1.2) Balanced search trees In this exercise, you will insert the numbers in the text box below into balanced search trees. They must be inserted in the order in which they are listed. Assume that the trees are empty before you begin. You should not write code, but write down which rules the tree must follow and show how the trees are built up step by step. 946 78 3512 i. Put the numbers in the text box above into a 2-4 tree. ii. Put the numbers in the text box above into a red-black tree