Consider a B + tree index with order d=1. Here, we use the convention 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*.