Use the following (algorithm 8.1) for updating the given (Fig 8.11) to meet the number of partition in two cases. For case-1 the given number of partitions are m=3 and n =4. For case-2 the given number of partitions are m=4 and n=4. Draw two updated figures one for each case. Explain in English text the steps of generating the updated figures.

Note: make your answer correct and clear.

Input: R1,R2,,Rm : fragments of relation R S1,S2,,Sn : fragments of relation S; JP: join predicate Output: T1,T2,,Tn : result fragments begin for i from 1 to m in parallel do send R entirely to each S-node I send Ri to each node containing a fragment of S end for for j from 1 to n in parallel do \{perform the join at each S-node \} Ri=1mRi;TjRJPSjendforend{Ri from R-nodes; R is fully replicated at S-nodes } 8 Parallel Database Systems Fig. 8.11 Example of parallel nested loop