Regarding to the following B+Tree(m=4), If we delete index k…

Regarding to the following B+Tree(m=4), If we delete index keys = all 4s, all 2s, and insert 6 what is the B+Tree index after the operations?  Note: Please show each step for deletion, not only the final answer.