For the following elements: 85,35,92,43,52,49,5,98,96,45 1) Show the resulting binary tree (with no rules) after adding the elements. You may assume the tree is empty at the start. 2) Show the resulting binary tree after adding the elements. You may assume the tree is empty at the start. This tree should maintain balance using the "lowest height in descendant" algorithm. 3) Show the resulting binary tree after adding the elements. You may assume the tree is empty at the start. This tree should maintain completeness at all times. 4) Show the resulting ternary tree after adding the elements. You may assume the tree is empty at the start. This tree should maintain balance using the "lowest height in descendant" algorithm. 5) Show the resulting non-binary tree (with no additional rules) after adding the elements. You may assume the tree is empty at the start. In each question, 1,2,3,4 and 5 show the tree step by step until you reach the final tree representation