trees and external storage true or falsenode splits in -tree have similarities to node splits in - tree in external storageindexing means keeping file of keys and their corresponding blocks records and their corresponding blocks keys and their corresponding records last names and their corresponding keys experiments carrying out these experiments will help to provide insights into the topics covered in the no programming is involved draw by hand what tree looks like after each of the following insertions and don' use the tree workshop applet draw by hand what - tree looks like after inserting the same sequence of values as in experiment think about how you would remove node from tree programming projects writing programs to solve the programming projects helps to solidify your understanding of the material and demonstrates how the concepts are applied (as noted in the introductionqualified instructors may obtain completed solutions to the programming projects on the publisher' web site this project should be easy write method that returns the minimum value in tree write method that does an inorder traverse of tree it should display all the items in order tree can be used as sorting machine write sort(method that' passed an array of key values from main(and writes them back to the array in sorted order modify the tree java program (listing so that it creates and works with - trees instead it should display the tree and allow searches it should also allow items to be insertedbut only if the parent of the leaf node (which is