A file is organized so that the ordering of data records is the same as or close to the ordering of data entries in some index. Then that index is called

With reference to the B⁺ tree index of order 1 shown below, the minimum number of nodes (including the Root node) that must be fetched in order to satisfy the following query: “Get all records with a search key greater than or equal to 7 and less than 15” is _________

Consider a B⁺- tree in which the maximum number of keys in a node is 5. What is the minimum number of keys in any non-root node?

A clustering index is defined on the fields which are of type