g Recall that a pre-order traversal of a binary tree is one in which the value of the root of the tree is visited first, followed by the left subtree then the right subtree of the root. For instance, given the following binary tree: 10 / \ 8 12 / \ \ 2 9 15 a preorder traversal would visit the values in the following order: 10, 8, 2, 9, 12, 15 For this problem, start by constructing a binary search tree -- based on the un-balanced BST algorithms covered in class -- from the values 5, 2, 9, 6, 3, 8, 1 (from left to right). In what order are the values visited in a preorder traversal of the resulting tree