projects implement two-level linear index for variable-length records as illustrated by figures and assume that disk blocks are bytes in length records in the database file should typically range between and bytesincluding -byte key value each record of the index file should store key value and the byte offset in the database file for the first byte of the corresponding record the top-level index (stored in memoryshould be simple array storing the lowest key value on the corresponding block in the index file implement the - treethat isa - tree where the internal nodes act only as placeholders your - tree should implement the dictionary interface of section implement the dictionary adt of section for large file stored on disk by means of the -tree of section assume that disk blocks are bytesand thus both leaf nodes and internal nodes are also bytes records should store -byte (intkey value and -byte data field internal nodes should store key value/pointer pairs where the "pointeris actually the block number on disk for the child node both internal nodes and leaf nodes will need room to store various information such as count of the records stored on that nodeand pointer to the next node on that level thusleaf nodes will store recordsand internal nodes will have room to store about to children depending on how you implement them use buffer pool (section to manage access to the nodes stored on disk