Consider a join (relation algebra) between relations \(r(R)\) and \(s(S)\)…

Consider a join (relation algebra) between relations $r(R)$ and $s(S)$ using the nested loop method. There are 3 buffers each of size equal to disk block size, out of which one buffer is reserved for intermediate results. Assuming $\operatorname{size}(r(R))<\operatorname{size}(s(S))$, the join will have fewer number of disk block accesses if