Suppose you have 2 relations, R(A,B) and S(B,C), with the following characteristics: The size of one disk block is 1000 bytes. Attributes A, B are of length 10 bytes. Attribute C is of length 180 bytes. The tuples are not spanned across disk blocks R = 5,000 (number of tuples of R) S = 500 (number of tuples of S) We have 30 blocks of memory buffer We use one disk block for one B+tree node Each pointer in a B+tree index (both a record pointer and a node pointer) uses 10 bytes. 1. (2 points) What is the minimum number of blocks needed to store R and S? 2. (2 points) We want to construct a dense B+tree on attribute B of table S by scan- ning the S table. What is the maximum possible n for the B+tree given the above parameters? Suppose you have 2 relations, R(A,B) and S(B,C), with the following characteristics: The size of one disk block is 1000 bytes. Attributes A, B are of length 10 bytes. Attribute C is of length 180 bytes. The tuples are not spanned across disk blocks R = 5,000 (number of tuples of R) S = 500 (number of tuples of S) We have 30 blocks of memory buffer We use one disk block for one B+tree node Each pointer in a B+tree index (both a record pointer and a node pointer) uses 10 bytes. 1. (2 points) What is the minimum number of blocks needed to store R and S? 2. (2 points) We want to construct a dense B+tree on attribute B of table S by scan- ning the S table. What is the maximum possible n for the B+tree given the above parameters