$1.$Consider the join operation between relation r and s $($ r $\backslash$theta s $),\backslash$theta is r$.$A $=$ s$.$B with the following information:

Relation r contains $10,000$ tuples and has $10$ tuples per block.

Relation s contains $5,000$ tuples and has $10$ tuples per block.

There are $33$ buffer blocks available in Memory$($M$).$

No sorted data in relation r and s$.$

Find Total cost $($block transfers$)$

Using Block Nested Loop Join $(1$ point$)$

Using Merge Join $(1$ point$)$

Using Hash Join $($Recursive partition$)(1$ point$)$

Using Hash Join $($No recursive partition$)(1$ point$)$

If there are the infinity of memory, what is the minimum of total cost $($block transfers$)?$ And why? $(1$ point$)$