Relations $A,B,$ and $C$ have to be joined on a common attribute $\text{'}x\text{'}.$

We have no index available for these tables.

There are in total $595$ pages in the buffer

A contains $3422$ pages

B contains $12411$ pages

C contains $8$ pages

Select the expected I$/$O costs for different join strategies below:

$($a$)$ Block nested loop join with $A$ as the outer relation and $B$ as the inner relation:

$($b$)$ Block nested loop join with $B$ as the outer relation and $A$ as the inner relation:

$($c$)$ Total cost of Hash join $($partitioning$+$probing$)$ with $C$ as the outer relation and $A$ as the inner

relation:

$($d$)$ Sort$-$Merge join of $AB$ assuming that the A and $B$ are all already sorted: