Consider a B+ tree index with order d=1. Here, we use the convention (that was used in class and

course notes) that for a given non-leaf node X, entries with key < X are on the left sub-tree and entries

with key X are on the right sub-tree of the node X.

a) What are the minimum and maximum numbers of data entries can each leaf node contain?

b) Show a B+ tree containing a root node and two leaf nodes, where the left leaf node contains the data

entry 2* and the right leaf node contains data entries 3* & 5*.

c) What is the resulting B+ tree after each of the following data entries with keys:

7, 11, 13, 17, 19, 23, 29

is inserted (one-by-one in the above order) into the B+ tree shown in Question 4(b)? Please make

sure you show a tree after each insertion (for a total of seven trees).

d) What is the resulting B+ tree after each of the following data entries with keys:

19, 17

is deleted (one-by-one in the above order) from the last B+ tree for Question 4(c), which contains

10 data entries? Please make sure you show a tree after each deletion (for a total of two trees)

Only need the questions C and D.

The oder is 1. min=max=1.