a$)$ Single nested loop

b$)$ Block nested loop

c$)$ Index nested loops with a hash index on B in s$.($Do the

computation for both clustered

and unclustered index.$)$

d$)$ Index nested loop $($no hash index$)$ for clustered and unclustered index.

where r occupies $2,000$ pages, $20$ tuples per page, s occupies $5,000$ pages, $5$ tuples per page,

and the amount of main memory available for block$-$nested loops join is $402$ pages. Assume

that at most $5$ tuples in s match each tuple in r$.$ Please explain properties for each concept. Besides the formulas to do the calculations I$\text{'}$m interested in a detailed explanation to understand properties for each concept.