Exercise 2: Program your own file lab7.cpp in which your main() function will test the new data structure. The main() function, Declares an instance of BinarySearchTree (short: BST) suitable to hold integer values. Prompts user to enter a random sequence of integer values, inserts these values into the data structure (the entered values should NOT be in sorted order). Calls the print BAR() member function to print out the values of the BST structure. Prompts user to enter a random sequence of integer values, remove these values from your BST. Print out the reduced BST. Exercise 3: Write a function printRange that takes as input a binary search tree t and two keys, k1 and k2, which are ordered so that k1 < k2, and print all elements x in the tree such that k1 <= x <= k2. Add the following member function in your BinarySearchTree class template.