(Query Processing) Let relation r1(A,B,C) and r2(C,D,E) have the following properties: r1 has 40000 tuples, r2 has 30000 tuples, 20 tuples of r1 fit on one block, and 10 tuples of r2 fit on one block. Estimate the number of block transfer and seeks required under the following scenarios: a. (5%) Assume that we implement Nested-loops join, and both r1,r2 are sorted. If we take r1 as the outer relation and r2 fits in memory, what is the number of block transfers and seeks required. b. (5%) Assume that we implement Nested-loops join, and only r2 is sorted. If there are only 3 memory blocks available and the minimal block transfers are required, what is the outer relation that we should pick from r1 and r2, and the number of block transfers and seeks required. c. (5%) Assume that we implement Block Nested-loops join, and none of the sorted. If we take r1 as the outer relation, and there are only 3 memory blocks available, what is the outer relation that we should pick from r1 and r2, and the number of block transfers and seeks required