Question I$[$B$-$Trees$]$: Consider the following B$-$Tree of order $4$:

$(5$ points$)$ Show the result of inserting the key $25$ into the B$-$tree. Illustrate each step in the insertion process, showing any necessary splits.

$(5$ points$)$ Now, starting from the modified tree after inserting $25$ in part $1,$ demonstrate the deletion of the key $40.$ Again, illustrate each step, showing any borrowing or merging operations that maintain the B$-$Tree properties.