1. [40 points] Consider the following B+-tree for the search key age. Suppose the degree d...

 

Transcribed Image Text:

1. [40 points] Consider the following B+-tree for the search key "age. Suppose the degree d of the tree = 2, that is, each node (except for root) must have at least two keys and at most 4 keys. Note that sibling nodes are nodes with the same parent. 43 2 5 6 8 9 6 10 17 19 10 13 17 18 19 20 30 43 44 56 70 56 58 70 73 a. [10 points] Describe the process of finding keys for the query condition "age >= 15 and age 1. [40 points] Consider the following B+-tree for the search key "age. Suppose the degree d of the tree = 2, that is, each node (except for root) must have at least two keys and at most 4 keys. Note that sibling nodes are nodes with the same parent. 43 2 5 6 8 9 6 10 17 19 10 13 17 18 19 20 30 43 44 56 70 56 58 70 73 a. [10 points] Describe the process of finding keys for the query condition "age >= 15 and age