Task $1\mathrm{.}1(1$ pts$)$: Name all the tree nodes that must be fetched to answer the following query: $$Get all records with search key greater than $38.$

Task $1\mathrm{.}2(3$ pt$)$: Name a search key value such that inserting it into the $($original$)$ tree would cause an increase in the height of the tree. Explain why the height will increase.

Task $1\mathrm{.}3(5$ pts$)$: Note that subtrees A$,$ B$,$ and C are not fully specified. Nonetheless, what can you infer about the contents and the shape of these subtrees? Consider the height, range of search keys, and the minimum number of key values and pointers that each intermediate node has.