(Solved) : Consider Database Following Tables Primary Keys Bolded Students Sid Studentname Age City C Q30219687 . . . .

Consider a database with the following tables (with primary keysbolded):

Students (sid, studentName, age, city)
Courses (cid, courseName, profName)
Registered (sid, cid,credits)

The Students relation has 8,000 tuples stored in 400 pages.There are 40 and 200 distinct val-
ues for attributes age and city, respectively. For the Studentsrelation three indexed are defined:
1- a hash index on the sid attribute 2- a clustered B+ tree indexusing Alternative (2) on the
city attribute; this tree has three levels and 500 leaf pages 3- anunclustered B+ tree index us-
ing Alternative (2) on the age; this tree has three levels and 400leaf pages. An unclustered B+
tree index using Alternative 2