Consider the relations Sailors (Sid, name, rating, age), Reserves (Sid, Bid, Price) (keys are underlined). One disk page can accommodate 30 tuples from the Sailors relations or 60 tuples from the Reserves relation. Given that there are 150,000 sailors and 600,000 reservations. What is the estimated I/O cost for the following scenarios? Use alternative 2. Assume one I/O is needed to retrieve a hash data entry and three I/Os are needed to retrieve a B+-tree data entry. Ignore the cost of writing out the results. 3) (5 points) Index Nested-loop join: Clustered Hash-index on Sid of Reserves (Reserves is inner) 4) (5 points) Index Nested-loop join: Unclustered Hash-index on Sid of Reserves (Reserves is inner)