Given the above information, answer the following questions. In all cases, please ignore the

cost of writing the final result back to secondary storage. Please make sure to show your

work for full credit.

$2\mathrm{.}1)(6$ points$)$ Block Nested Loops Join

Choose the outer relation such that the total cost is minimized. How many $($a$)$ total reads

and $($b$)$ total writes are required?

$2\mathrm{.}2)(7$ points$)$ Grace Hash Join

How many $($a$)$ total reads and $($b$)$ total writes are required? Assume the relation is evenly

distributed in the partitioning phase.

$2\mathrm{.}3)(7$ points$)$ Suppose we give you a new disk, and that reading a page from this disk will

take $1\backslash$mu s$,$ and writing a page to disk will take X $\backslash$mu s$.$ Given your above analysis, for which

values of X would you choose the block nested loops join? For which values of X would you

choose the hash join? Round X to the nearest hundredth if necessary $($e$.$g$.,$ if X $=7\mathrm{.}346$ use

$7\mathrm{.}35$ as your final value for X$).$