Please explain for further understanding if possible

We've seen how B+ Trees can be used to build indices for efficient access to data. In this question, we'll strengthen our present understanding of B + trees and look at a quick-yeteffective optimization. Let's assume you've inherited a database of 2 billion rows from your relatives. The rows contain a string field called 'unique name' and a few other fields. Given the enormous size of the database, you decide to build a B+ tree indices on the 'unique name' field. Use the following values for calculations: - Each page is exactly 4KB (4096 Bytes) - The size of each key in your B+ tree is 128 bytes - The size of each pointer in your B+ tree is 8 bytes - Your system has 48GB of free RAM and infinite hard disk space - Assume a B+ tree node must fit into a single page. - The constant fan-out f of the B+ tree is 66. Let's look at how our B+ tree would look with the amount of data we need to index. Fit it in the system Question 3.1 [3 points] How many pages can we store in the first level? In the second level? In tenth level? Question 3.2 [6 points] Let's plan out the space required for our index. How many levels do we need in our B+ tree? Compute the space required by each index level (round up to the first decimal place)