This question is related to Database Management

please,don't answer with handwriting .

Thank

Year 2020, You are hired as a database developer in a new established university. Yoiu are required to computerize the existing students information system. The details are as follows: . Currently enrolled students "r" : 25,000 . Block size "B" of disk to store data is 512 bytes. .Record pointer "P" size is 7 bytes . Each record is of fixed length with following attributes. Attributes Size (in bvtes 30 30 ex 10 Phone Address 30 Your task is to a) Calculate number of file blocks "b" to store data of all the students. b) Calculate umber of index blocks bi , if the file is ordered by StudentId and a primary index is constructed on same field. c) show how binary search algorithm with primary indexing would be a better choice than binary search algorithm without primary indexing, (by compare the average cost in terms of block accesses) [ Note: You may need to calculate some intermediate values to get final results ]