answer these questions related to SQL.

a. All nodes in a B+ tree contain search keys. Pointers to file records are contained in: a) all nodes, b) leaf nodes only, or c) non-leaf nodes only? _______

b. When B+ trees are used in databases, a non-leaf node of the tree will often have a hundred or more child nodes. Why? Is it: a) because a node is taken to be the same size as a disk block, b) to save on pointer storage, or c) to increase disk accesses. _______

c. The cost of searching a B+ tree is closely related to: a) the number of nodes in the tree, b) the depth of the tree, or c) the value of the smallest search key at the root node of the tree? ______

d. True or false: B+ trees can be used to find all records with search keys belonging to a certain range. True_____ False_____

e. Assuming good design, which do you expect to give the faster search result? a) a search tree, b) a hash table. ___________