Consider a parallel system with shared nothing architecture. Assume that there are three processors P$0,$ P$1$ and P$2$ with associated disks D$0,$ D$1$ and D$2,$ Assume that the records with the following keys are partitioned among the disks such that record with key. $k$ goes to disk Di if kmod$3=i$ :

$26,16,27,15,30,18,14,25,10,9,8,24,5$

Assume parallel external sort merge is used to sort the records. Depict what will be the contents of the disk before sorting. Assume that the same partition vector $11,20$ is used in the merge phase. Show snapshots of data distribution after the various steps of parallel extemal sort merge.