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: If you do not answer correctly, and if you do not draw two updated figures, one for each case correctly. I will give you an unsatisfactory rating

Algorithm 8.1: Parallel Nested Loop (PNL) 8 Parallel Database Systems Fig. 8.11 Example of parallel nested loop