int ReturnSet public void Generateset (const Node node int array, int &position private The Returnset will return a sorted array of the items in the tree. This method will create an array using dynamic memory allocation that is the size of the number of nodes in the tree. This array will be populated by the Generateset method. ReturnSet calls Generateset and passes it the root of the tree, the pointer to the created array, and the start position in the array (i.ee index zero). Below is an example function call to Generateset made by ReturnSet int start position 30; Generateset(root, array, start position Generateset will populate the array by performing the recursive in-order traversal of the tree and initializing the array element at position to the value of the node's data. The result will be an array of the values in the tree stored in ascending order. It is left up to you to determine how this is done and when to update the position parameter during this traversal. It should be noted that you must have a clear understanding about how arrays are handled when passed as arguments to functions, how reference variables work when modified by a function, and recursion