Reading. In the Database Systems Concepts book, read sections 11.2.2,11.2.3,11.2.5-11.3.2, 11.6, 11.8, 12.3-12.5.4.1. Answer the following questions. In multiple choice questions where the possible answers are a,b,c.. please answer with the correct letter. 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. 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? True or false: B+ trees can be used to find all records with search keys belonging to certain range. True d. a False Assuming good design, which do you expect to give the faster search result? a) a search tree, b) a hash table. e. f. True or false: a benefit of a B+ tree is that it stays balanced as updates occur. True False True or false: In a hash table, the need for overflow buckets increases if the hash function does not assign search keys to buckets in a random way. True g. False What works better for a query that specifies a range of values: a) an ordered index, or b) a hash table? h. i. (This question requires the use of Google) With MySQL, can a database administrator specify that a hash index is to be used with a table? Yes No (Fill in the blank) In the worst case, lookup using a hash table is no better than