A b tree whose height changes from 2 to 3 when the value 25 is inserted. show your structure before and after the insertion.
a) Illustrate the B-tree structure before and after the insertion of 25.
b) Explain the steps involved in inserting a value in a B-tree.
c) Compare B-tree and binary search tree (BST).
d) Discuss the advantages of using a B-tree over a binary search tree.