We store 1 000 000 records in a database, using bucket hash. A record takes 110 bytes, a block is 3000 bytes, a key is 25 bytes, while a pointer is 64 bytes. Reading a block takes 5 ms. The record access time must not be greater than 20 ms. The bucket catalog fits in the memory, and the hash function is even. o What is the average record access time? o How many bytes does the bucket catalog occupy from the memory? o How much extra memory do we need to reduce the block access time to its half? How long does it take at maximum, to read the contents of a record if the memory has 5000 bytes free space? (One block operation takes 5 ms) o Does it help with the record access time if we have 10 times as much free memory? What if we have 100 times as much? How should we use the extra memory? 1 1