Assume that each node has room for 3 keys and 4 pointers, and the ordering of keys is alphabetic. Draw the B+tree with the following insertions and deletions, in the order specified. Show the resulting tree after each insertion/deletion.

Insert: 5, 10, 20, 15, 85, 75, 60, 50, 55, 65, 70, 28, 25, 30, 90, 95, 80

Delete: 70, 25, 60