Consider the natural join RS of relations R(a, b, c) and S(c, d, e) given the following:

Relation R contains NR = 20,000 tuples with 25 tuples per page.

Relation S has NS = 45,000 tuples with 30 tuples per page.

B = 601 buffer pages are available.

Assume that both relations are stored as simple heap files and that neither relation has any indexes built on it.

Find the costs (in terms of disk accesses) of the Nested Loops Join