Q4. Suppose we have the following relations: R(A,B,C) and S(D,E,F). Assume that R uses 500 blocks on disk, and S uses 6,000 blocks. Assume that you got the best possible hash

function and there are no overflows for the hash. Assuming that there are 102 blocks of memory space for query processing, what is the least cost (in terms of disk block IOS) for partition hash join for the query R JOINC=D S?