Part 2 I/O Cost Estimations Question 2.1 1/0 Cost Estimation Consider two unordered, non-clustered relations R and S with B(R) 200,000 and B(S) - 2,000 blocks, and S(R) = 2, and S(s) - to You have M = 101 memory pages available. Let R has an index on the joining attribute C. Compute the minimum number of I/O operations needed to join these two relations us- ing tuple-based-nested-loop join (relations are clustered), block-nested-loop join (relations are non- clustered), merge-join the inputs are not sorted but contiguous), and non-clustering index-join (relations are clustered, read of S with uniform distribution assumption and expected 30 matching tuples on R for S) and hash-join (relations are clustered but not sorted). You can assume that the hash function evenly distributes keys across buckets. Justify you result by showing the I/O cost estimation for each join method