format Painter ETU. a , * ALA ELEIE Emphasis Heading 1 1 Heading 31 Normal Strong Subtitle Feet Question 2.2 The Student file consists of 50,000 fixed-length records, each of length 76 bytes, that are stored in an unspanned organization. Two fields that are of interest for record access are: (a) Student Number, which is the primary key with a size of 10 bytes, and (b) Department Number, which is a foreign key with a size of 3 bytes You may assume that there are 150 departments and each department has approximately the same number of students. (a) If the records in the Student file are ordered by Student Number, how many block accesses would be required to locate a record randomly based on Student Number using a Student Number Bi-tree index? (b) of the records in the Student file are ordered by Student Number, how many block accesses would be required to locate relevant records randomly based on Department Number using a Department Number B tree index? (c) if the records in the Student file are ordered by Department Number, how many block accesses would be required to locate a record randomly based on Student Number using a Strident Number B+-tree index, est words Search ote NO format Painter ETU. a , * ALA ELEIE Emphasis Heading 1 1 Heading 31 Normal Strong Subtitle Feet Question 2.2 The Student file consists of 50,000 fixed-length records, each of length 76 bytes, that are stored in an unspanned organization. Two fields that are of interest for record access are: (a) Student Number, which is the primary key with a size of 10 bytes, and (b) Department Number, which is a foreign key with a size of 3 bytes You may assume that there are 150 departments and each department has approximately the same number of students. (a) If the records in the Student file are ordered by Student Number, how many block accesses would be required to locate a record randomly based on Student Number using a Student Number Bi-tree index? (b) of the records in the Student file are ordered by Student Number, how many block accesses would be required to locate relevant records randomly based on Department Number using a Department Number B tree index? (c) if the records in the Student file are ordered by Department Number, how many block accesses would be required to locate a record randomly based on Student Number using a Strident Number B+-tree index, est words Search ote NO