Hello I would like to solve this homework today in detail, please

Question 3 Given The following current state of the extendable hash index of relation R; insert 3 then 10 to the hash table where:

H(0) = 0000 H(8) = 1000 H(2) = 0010 H(10) = 1010 H(3) = 0011

Note that, the first i high order bits are used as a displacement into a bucket and the bucket can hold up to 2 records. Show your steps.

Question 4 Assume you have a database relation file R (a, b, c) which a is a primary key attribute and b is a secondary key attribute that have the following properties: Each disk block stores B = 3,704 bytes. The data file has 270,000 records, each record has size of 100 bytes and Sequentially ordered on the attribute a. A dense index on attribute b has been created. Each index entry occupies 15 bytes: 9 bytes for search key, and 6 bytes for record pointer How many block access is needed to search for a record with: Case 1: specific attribute a using original file. Case 2: specific attribute b using the original file. Case 3: specific attribute c using the original file. Case 4: specific attribute b using index file.

1 o 2 1 0 1 1 00