Assume we have two relations R(a,b,c) and S(d,e,f), and R is sorted on , and s is sorted on . Relation R is stored in 50,000 pages, and relation S is stored in 10,000 pages. Explain the algorithm you use to implement the set di erence operation, knowing that you have 100 buffer pages available. What is the cost of this algorithm?