Read about the database and answer the following :

Read the following information about the database and answer the questions below. REMEMBER: Floor for entries, Ceiling for blocks Database information: The database has 100,000 location records (AKA rows) Our O/S uses physical block sizes of 4096 bytes A location has the following fields and FIXED sizes in bytes . id (primary key): 4 bytes address: 256 bytes city: 50 bytes county: 50 bytes state: 2 bytes zip: 5 bytes owner_info: 512 bytes Index 11 is based on id. Each index entry in 11 contains the id and a 4-byte pointer to the next block in the index (or a record's data block) Index 12 is based on state, address, and id. Each index entry in 12 contains state, address, id and a 4-byte pointer to the next block in the index (or a record's data block) L How many index blocks are in the leaf level of Index 12? M. How many levels are in Index 12? N. How many total reads (index + data) to find a single record by id using index 11? 0. How many total reads (index +data) to find a single record by state, address, and id using index 12? P. Assume: the average # of properties per state is 2000. Assume: no 2 properties in the same state will be on the same data block using this clustering technique. If we CLUSTERED our records based on Index 11, using the average # of properties per state, how many data block reads would it take to fetch all of a single state's properties using 117 Q. Assume: the average # of properties per state is 2000. If we CLUSTERED our records based on Index 12, using the average # of properties per state, how many data block reads would it take to fetch all of a single state's properties using 12? Read the following information about the database and answer the questions below. REMEMBER: Floor for entries, Ceiling for blocks Database information: The database has 100,000 location records (AKA rows) Our O/S uses physical block sizes of 4096 bytes A location has the following fields and FIXED sizes in bytes . id (primary key): 4 bytes address: 256 bytes city: 50 bytes county: 50 bytes state: 2 bytes zip: 5 bytes owner_info: 512 bytes Index 11 is based on id. Each index entry in 11 contains the id and a 4-byte pointer to the next block in the index (or a record's data block) Index 12 is based on state, address, and id. Each index entry in 12 contains state, address, id and a 4-byte pointer to the next block in the index (or a record's data block) L How many index blocks are in the leaf level of Index 12? M. How many levels are in Index 12? N. How many total reads (index + data) to find a single record by id using index 11? 0. How many total reads (index +data) to find a single record by state, address, and id using index 12? P. Assume: the average # of properties per state is 2000. Assume: no 2 properties in the same state will be on the same data block using this clustering technique. If we CLUSTERED our records based on Index 11, using the average # of properties per state, how many data block reads would it take to fetch all of a single state's properties using 117 Q. Assume: the average # of properties per state is 2000. If we CLUSTERED our records based on Index 12, using the average # of properties per state, how many data block reads would it take to fetch all of a single state's properties using 12