Write a C (or C++) program to read a binary file. The program will create a B-tree of order five (5) from the binary file. The B-tree will store the id of each record and position of each record in the file. If any id is a duplicate, print a message so indicating and do not load the duplicate. After building the B-tree, the program will use the B-tree to find records with a specified id and print the id and associated info from the file. Write the program for command line arguments so that the filenames can be entered at the command line. There are two files to process. You can copy these files into your "pt" account. File one is "[login to view URL]". After building the B-tree from file "[login to view URL]", print the tree using the Pascal printtree algorithm provided. You translate it into C (or C++). After the B-tree has been printed, print the id and the info that corresponds to the following ids. If the id does not exist print a message so indicating: 29757 29897 14879 12983 7226 20982 17515 29121 22065 4781 6747 25980 File two is "[login to view URL]". Do not print the tree for this one; it is too large. After the B-tree has been built, print the id and the info that corresponds to the following ids. If the id does not exist print a message so indicating: 28584 24871 8540 4329 18376 2200 7619 32064 5977 26150 26633 23025 30379 27224 17099 30360 /*---------------------------------------- Printtree --------- | Function: Printtree | | Purpose: The function prints the contents of the Order N B-tree to | the screen. The Root prints at the left margin, each level | of the tree is shifted over and vertically aligned. The | structure of the tree is visible. | Parameters: | (IN = USED TO PASS DATA INTO THIS FUNCTION, | OUT = USED TO PASS DATA OUT OF THIS FUNCTION | IN/OUT = USED FOR BOTH PURPOSES.) | p : IN points to the root to the current subtree. The address | of the root of the tree is the initial value of p. | level: IN identifies the level of the node pointed to by p. | Initially has value 0. | | Returns: No value returned *------------------------------------------------
## Deliverables
Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. Complete copyrights to all work purchased.
## Deadline information
as soon as posible