Problem
1. Rewrite the function search_node to use binary search.
2. A B*-tree is a B-tree in which every node, except possibly the root, is at least two-thirds full, rather than half full. Insertion into a B*-tree moves entries B*-tree between sibling nodes (as done during deletion) as needed, thereby delaying splitting a node until two sibling nodes are completely full. These two nodes can then be split into three, each of which will be at least two-thirds full.
(a) Specify the changes needed to the insertion algorithm so that it will maintain the properties of a B*-tree.
(b) Specify the changes needed to the deletion algorithm so that it will maintain the properties of a B*-tree.
(c) Discuss the relative advantages and disadvantages of B*-trees compared to ordinary B-trees.