Please Help, please label your work

All tables are stored in packed form in blocks of length 4096 bytes. Student has 10,000 tuples, each 200 bytes long. It is hashed on stuld, the primary key, and has a secondary non-clustered index on 1astName, with three levels. There are 8,000 values for 1astName, 2,000 values for firstName, 25 values for major, and 150 values for credits. Faculty has 800 tuples of length 100 bytes. It has an index on facid, the primary key, with two levels. There is a secondary non-clustered index on department, with one level. facName has 650 values, department has 25 values, and rank has 4 values. Class has 2, 500 tuples with length of 100 bytes. It is hashed on classNumber, the primary key, and has no secondary indexes. facid has 700 values here, schedule has 35 values, and room has 350 values. Enroll has 50,000 tuples with length of 100 bytes. It has a composite index on the primary key, (classNumber, stuId), with four levels, and it has no other index. The attribute grade has 10 values. a. Find the blocking factor and total number of blocks needed for each of the four relations. Use this information for the questions that follow b. Calculate the following selection sizes, assuming uniform distribution of attribute values: s(major = Art. Student) s(rank = Professor, Faculty) s (grade = A, Enroll) s (room = A205', Class) Find the read cost only (no writing costs) of Class |x| Enroll using nested loops with: a. class as the outside loop and buffer size of only two blocks b. Enroll as the outside loop and buffer size of two blocks c. Class as the outside loop and buffer size of 10 blocks d. Enroll as the outside loop and buffer size of 10 blocks