Q3 B Tree 6 Points Consider that you are going to create a B tree index for a file of 3600 records with unique keys. Each node can store up to 18 records. Q3.1 3 Points In the worst case, what is be the maximum number of disk page access to locate a record with a given key? Assuming all levels of the index is in the persistent storage. Enter your answer here Q3.2 3 Points What is the minimum number of levels in the B tree to accommodate that number of records? Recall that the root node is considered as level 1. Enter your answer here