Show the sequence of the B-trees resulting from inserting 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, in this order, into an empty B-tree. Then show the sequence of the B-trees resulting from deleting 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, in this order, from the last B-tree of the insertions above. Use minimum degree t = 2, and use the insertion/deletion algorithms described in class (and in the book). Just show the resulting B-trees no need to show trace of individual insertion/deletion processes like splitting/merging of nodes and rotations.