Consider the join R ▷◁ S where the join predicate is R.a = S.b, given the following metadata about R and S: Relation R contains 2,000 tuples and has 10 tuples per block Relation S contains 10,000...

Consider the join R ▷◁ S where the join predicate is R.a = S.b, given the following metadata about R and S:

• Relation R contains 2,000 tuples and has 10 tuples per block


• Relation S contains 10,000 tuples and has 10 tuples per block


• Attribute a of relation R is the primary key for R, and every tuple in R matches 5 tuples in S


• There exists a primary index on S.b with height 3


• There exists a secondary index on R.a with height 2


• The buffer can hold 5 blocks

What is the cost of a plan that evaluates this query using sort-merge join. Show the details of your cost analysis.

Please show detailed explaination.