I have a hole host of questions about this but i don't have a clue as to how to do them ... here is one .. im hoping to see exactly how its done so that i can do the rest.. thanks

Execute the following sequence of operations on an initially empty ADT table t that is implemented as a B-tree of degree 5.
*Note that insertion into an empty B-tree will create a single node that contains the inserted item.

t.tableInsert (10)
t.tableInsert (100)
t.tableInsert (30)
t.tableInsert (80)
t.tableInsert (50)
t.tableDelete (10)
t.tableInsert (60)
t.tableInsert (70)
t.tableInsert (40)
t.tableDelete (80)
t.tableInsert (90)
t.tableInsert (20)
t.tableDelete (30)
t.tableDelete (70)