Assume that we wish to execute a R S, and the available memory will vary between M and M/2. In terms of M, B(R), and B(S), give the conditions under which we can guarantee that the following algorithms can be executed:

c) A two-pass, sort-based join