Please help solve this c++ Binary Search Tree exercise.... All the necessary code is included. Thank you in advance your help is much appreciated.

\fVectors and Binar Search Trees (BSTs) Write a program that takes from the user n integers and stores them a vector of int. Then, create a function insertAfter that takes rstValue and secondVa/ue. This function searches for each occurrence of rstValue in the vector and insert the secondVa/ue after it in the same vector. The first and second values are taken from the user. Create another function that creates a BST based on the vector's elements given that if the value occurs more than once in the vector then it should be reected in the number of occurrences of that node in the BST. This function should then return the BST. Finally, create a member function in the binary search tree class that returns the sum of all nodes. (Hint: You need to traverse the tree and add the values of the nodes.)