Assume the join operator is allowed to use M = 10 pages of memory. What is the least-cost method that we could use to join the two relations with a nested-loop type of join algorithm? Describe the method for the R and S relations and compute its cost.

(15 points) Consider two relations R and S with the following sizes: (b) (5 points) Assume the join operator is allowed to use M=10 pages of memory. What is the least-cost method that we could use to join the two relations with a nested-loop type of join algorithm? Describe the method for the R and S relations and compute its cost