please solve in c++ please

(5 points) Given a 5 element stack S (from top to bottom: 1,3, 5,7,9), and arn empty queue Q, remove the elements one-by-one from S and insert them into Q, then remove them one-by-one from Q and re-insert them into S. S now looks like (from top to bottom). a) 1, 3, 5,7,9 b) 9, 1,3, 5,7 c) 9,7,5,3,1 d) none of the above (15 points) Given a sequence of numbers: 11, 6, 8, 19, 4, 13, 5, 17, 43, 49, 16, 31, 32 6. a. (5 points) Draw a binary search tree by inserting the above numbers from left to right b. (5 points) What is the height of the above tree? c. (5 points) List the result sequences from preorder, inorder, and postorder traversals? Preorder: Inorder