Problem: In the lecture we discussed the join of two relations R and S, with 1000 and 500 blocks, respectively, and M = 101. However, we need additional disk L'O rs if there are so many tuples with a given value that neither relation's tuples could ?t in main memory. Calculate the total number of disk I/O '5 needed if there are only two y-values, each appearing in half the tuples of R and half the tuples of S (recall Y is the join attribute or attributes).