In C++ code

Define the Node class for a BST (for simplicity, assume the BST has integer elements). Define a Binary Search Tree class that implement the node as well as the BST class. In the BST class, implement the search, insert, remove, and print functions as shown in the textbook. Add the function nodeLevel (int value) to the Binary Search Tree class that returns the level of the node value in the Binary Search Tree (returns 1 if node is not found). Write a main function to build a BST tree with at least 10 different elements using insert function, test the search function, removal function, nodeLevel function, and display the BST after each of the function calls. Submit both code and sample output