Problem 6 [6 points! A binary search tree of integers is constructed of nodes defined using the following C++ struct: str'uct Node { int value; @ Node* left; Node* right; 1,- @ @ Given a binary search tree of integers, write a C++ @ function between that takes the root node pointer of a tree, an int lower bound lower, an int upper bound upper, and a reference to a std: :set, @ Q and adds into the set all integers in the tree that are between the lower and upper bounds, inclusive. For instance, using the example tree depicted here, a call to between(r'oot, 36, 89, result) would populate the result set with 40, 55, 60, 70, 80. void between(|\\iode* root, int lower', int upper', std::set& r'esult) {