1) Relation bankCustomer has 50,000 tuples, which are stored as fixed length and fixed format records; each has the length of 350 bytes. Tuples contain the non-key attribute name with length of 15 bytes. The tuples are stored sequentially in a number of blocks, ordered by name. Each block has the size of 4,096 bytes and each tuple is fully contained in one block. What is number of disk blocks needed to store the relation bankCustomer? [2/40] 2) With the same information in Part A, Question 1), suppose that a primary index using B +tree on the name attribute is to be created. A 10-byte pointer to actual tuples (an 8 byte block id and 2 byte offset) is needed for each index entry. Each index entry is also fully contained in one block. If the primary index is sparse, i.e. one index entry for one block, what would be the maximum number of blocks needed to store the index? [2/40] 3) With the same information in Part A, Question 2), what would be the minimum number of blocks needed to store the index? (Hint: in this case, all tuples have the same name) [2/40]