Consider an Employee table with 100,000 rows, t(Emp)=100,000. 10 employee records fit per disk page, P(Emp)=10,000. There is a non-clustered hash index on the SS# of the Emp table with a loading factor of 80%. This index structure consists of 100 buckets with no overflow chains. SS# is the primary key and its values are unique, v(SS#, Emp) = 100,000.

9. (10 points) How many I/Os are required to fetch those employees whose salary is 100K? Explain your answer.

10. (10 points) How many I/Os are required to fetch the employee whose SS# equals 232-56-7878? Explain your answer.