(Programming) Assignment 3.            Due 07 Dec 2015
                                                           NO EXTENSION  PERIOD
1. 
    Write a C++ program to implement a B-TREE Class that implements a 
    m-n B-TREE  where m (number of branches for internal node) and n (number of
    items in a leaf)  are passed as parameters to the
    constructor.  B-TREE Class should contain the following member functions:

	insert       (I   string containing key + rest of the record)
	delete       (D   string containing key)
	search       (S   string containing key)
	printall     (P      )
        printsector  (R   string containing sector address)

    Write a main program driver to perform insert, delete, search and 
    printall functions on a B_TREE.
   
    
    You may assume that the sector length is 300 characters and there are 
    5000 such sectors.  You choose any reasonable constants.
    You may declare them as a huge two dimensional array.  Your program 
    receives input from user regarding record length and key length.  Based
    on this information, your program calculates m and n and invokes the
    constructor of the B-TREE.  After initialization, users insert/delete and
    search entire records.  

    Also provide a function to print the entire sector given the sector number.
    This is for debugging and testing purpose.
    
    (Details presented during regular class hours)

    You must fix an appointment with instructor (1/2 hour) to demonstrate your project.
    OTHERWISE you get 0 points for the project.