Nested loop join vs. block nested loop join on relations r and s. Suppose memory buffer can only hold three blocks. Each block can hold 3 records from r or 2 records from s. Suppose r has 4 records and s has 5 records as shown below (Note record ids such as rl, r2, s1, etc. are for convenience of discussion so you can use them in your answer, but they are not part of the tables) rl 3 r2 3 13 4 r4 6 23 25 72 18 s1 s3 s5 25 23 72 23 59 Assume r is the outer relation, and the join attribute is B For nested loop join algorithm, show memory buffer snapshots (see the figure below) to indicate which records from both relations r and s are brought into the memory. And when these records are in memory, indicate the order of joined records produced. Block forr (2 columns) Block fors (2 columns) Result (3 columns) For each of these two algorithms, you should summarize your work by comparing the number of block transfers in each algorithm, and the order of resulting tuples produced by each algorithm. Nested loop join vs. block nested loop join on relations r and s. Suppose memory buffer can only hold three blocks. Each block can hold 3 records from r or 2 records from s. Suppose r has 4 records and s has 5 records as shown below (Note record ids such as rl, r2, s1, etc. are for convenience of discussion so you can use them in your answer, but they are not part of the tables) rl 3 r2 3 13 4 r4 6 23 25 72 18 s1 s3 s5 25 23 72 23 59 Assume r is the outer relation, and the join attribute is B For nested loop join algorithm, show memory buffer snapshots (see the figure below) to indicate which records from both relations r and s are brought into the memory. And when these records are in memory, indicate the order of joined records produced. Block forr (2 columns) Block fors (2 columns) Result (3 columns) For each of these two algorithms, you should summarize your work by comparing the number of block transfers in each algorithm, and the order of resulting tuples produced by each algorithm