C++

5. (6 marks) Inserting the following keys to a 5-way B-Tree: 3,7,9,23,45,1.5, 14, 25,24,13,11,8,19,4,31,35,56. 16. (5 marks) Show the BST after calling InsertNewltem(7), InsertNewltem(10), InsertNewltem(9), InsertNewltem(6), and InsertNewltem8) consecutively in an ntil empty BST. Write the printing result in postorder. Write the algorithm PostOrderTraverse( ) which prints the elements in the BST postorder