please use this table to do the calculation

B: # of page(data blocks) D: Avg. time read and write F: # of B+Tree children

(30pts) Question 1: Storage and Indexing Consider the relation below: Student (sid, sname, major, email) - The sid is a key (i.e., sid values are unique) - Assume sid values are uniformly distributed between '100' and '204,900 All attributes have type char(40) (i.e., each attribute's size is 40 bytes) The relation contains 100,000 records (assume fixed length records) Block size is 16KB+8byte (assume each page has additional 8 bytes to store the pointer to next page) Assume the time to read/write to/from a page is D; assume the records are compacted and there is no gap between records. Assume each record pointer (RID) size is 8 bytes. Assume 1KB 1000 bytes - - - Show your work for all questions below. (a)(10pts) Assume relation Student is stored in a heap file. What is the cost of (i) file scan, (ii) equality search (sid-'25700'), (ii) range search (sid