Extend the sort-merge join algorithm shown in the modified figure below to implement the left outer join operation.

193a.txt Modified Figure 19.3 (a) Implementation of the sort-merge join between tables R and S with (RA = SB) sort the tuples in R on attribute A; // assume R has n tuples (records) sort the tuples in S on attribute B; /1 assume S has m tuples (records) = 1; // initialize the record pointer of table R j 1 initialize the record pointer of table S while ((i to T; /IT is the result table q++i pt+i = p; // update the primary record pointer of table R j q; // update the primary record pointer of table S