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.

Which is the smaller relation i.e. which is the one with the fewer number of pages? Write down the number of pages in the smaller relation (call it M) and the number of pages in the larger relation (call it N).