Problem
Write a C++ program to construct a B-Tree with the degree of 5 using the following values: 16, 1, 3, 8, 22, 25, 2, 5, 6, 7, 13, 14, 15, 18, 20, 23, 24, 37, 27
The program will enter all values. design your B Tree node structure and then, perform the following programs.
• show the constructed B-tree with showing the actual tree structure (not just the traversal list.)
• Insert the following values: 35, 21, 9. Then, display the tree structure.
• Delete the following values: 22, 8, 3. Then, display the tree structure.
It must be one program file but display all three results separately.