Q4 B+ Tree 6 Points Consider that you are going to define a B+ tree index for the same file of 3600 records with unique keys. The leaf nodes can store up to 18 records and non-leaf nodes can store up to 200 keys. Q4.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 if two levels of the index are in the memory? Enter your answer here Q4.2 3 Points What is the minimum number of levels in the B+ tree to index that number of records? Recall that the root node is considered as level 1. Enter your answer here