Question 1 Consider an extendible hash index with all of directory pages (storing pointers to buckets), bucket pages (storing data entries), and data pages (storing data records) on disk. The index uses Alternative (2) for data entries. Assume there is no overflow page. There are 1,000,000 records. Each record has 100 Bytes. Each data entry has 20 Bytes. Each directory entry has 10 Bytes. A disk page has 4000 Bytes. Each bucket is 1/2 page full. (1) What is the number of data pages? What is the number of bucket pages? What is the number of directory pages? (2) What is number of 10 pages required to retrieve a record by a search key value k using this index, assuming that the search key is a candidate key? (3) In (2), if the search key is not a candidate key and 10 records match the search key value k, what is the 10 cost to retrieve the matching records using the hash index. You can assume the hash index is clustered but first explain what is required of a clustered hash index. (4) Same as (3) but assume the hash index is unclustered