Create an ADT for a B+tree. In the tree structure, provide an additional metadata variable that identifies the address of the far-left node in the file. Then modify the traversal function to use the address of the far-left node and the next node pointers to traverse the tree.