short c++ help.

Suppose the numbers 7,5,1,8,3,6,0,9,4, 2 are inserted in that order into an initially empty binary search tree. The binary search tree uses the usual ordering on natural numbers. What is the in-order traversal sequence of the resultant tree? Select one: . 7 5 1 0324689 b.9864230157 c. 0243165987 d. 0123456789 Which of the following may be the inorder traversal of a BST? Select all that apply. Select one or more: a. 1,7,11,22,25,31,46 b. 30,22,17,14,9,6,0 c. None of them d. All of them e. 2, 6, 5, 11,13,22,34 f. 2,6,10,15,30,55,80 Which of the following about recursive function are correct? Select all that apply! Select one or more: a. Have a base case b. Maintain the index of the phase in the recursion C.Have an integer return value d. If a recursive function is named 'getSum' then there is a call to getSum inside the getSum function