B-tree with all the trimmings in visual C++

Complete Microsoft Visual C++ 6.0 source code that performs the following. (visual Basic ok) A b-tree class that supports operations of: Creation of a new tree Destroy an existing tree Add a key to exsisting tree Delete a key from tree Write exsisting tree to disk Load an exsisting tree from disk Print a representation of the tree to screen. (print must output tree, but it does not need to be spaced like a tree just level downward like one i.e. * * * * * * *(buff #) *(buff #) *(buff #) *(Buff #) The printed representation of the tree must show the buffer positions for each key in the bottom-most nodes.) I will test the code by doing the following: 1. Create a tree (read a series of strings [keys]) 2. Store the strings into a buffer. 3. It should then add the key & buffer position to tree 4. After all strings are entered (flexible from 1 to 100), writes buffer and index to file/disk 5. Destroy the tree 6. Load the tree and data from disk/file 7. prints the tree and data to screen. ## Deliverables 1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. 3) Complete ownership and distribution copyrights to all work purchased. Unless otherwise specified. ## Platform OS Microsoft 2000 Compiler Microsoft Visual C++ 6.0 OR Microsoft Visual Basic 6.0