$4.(10$ pts$)$ Let relations r$1($A$,$ B$,$ C$)$ and r$2($C$,$ D$,$ E$)$ have the following properties: r$1$ has $20,000$ tuples, r$2$ has $45,000$ tuples, $25$ tuples of r$1$ fit on one block, and $30$ tuples of r$2$ fit on one block. Estimate the number of block transfers and seeks required using each of the following join strategies for r$1$ Join r$2$:

A$.$ Merge join

B$.$ Hash join