Assume that you have the following table: Item

SSN name age

2 Pete 13 ; 3 Bob 23 ; 5 John 49; 7 Joe 45; 11 Alice 77 ; 17 Lily 3 ;19 Manny 33 ;23 Gertrud 29 ;29 Heinz 14 ; 39 Sammy 34

Create a B +-tree for table Item on key SSN. Assume that the tree is initially empty and values are added in the order shown in the table above.

Construct B +-tree for the cases where the number of pointers that will fit in one node is as follows:

a. Six

b. Eight