While HeapSort (as we saw in Studio 6) is more amenable than MergeSort to an in-place implementation MergeSort has its own advantages. For this problem, suppose you want to perform MergeSort on a really huge array A. The array is so big that it doesn't fit in your computer's memory and has to be stored in the cloud. More specifically, assume that our computer has enough memory to hold 3b elements, for some constant b, but A has size n much greater than b. We can call read (X, , B) to read a chunk of b elements from an array X (in the cloud) starting at index i into a local array B. Similarly, we can call write(C, X, i) to write a chunk of b elements stored in local array C to a cloud array X starting at index i. Here's a proposed (incomplete!) implementation of the merge operation that merges cloud arrays X and Y into cloud array 2. The code uses local arrays A, B, and C, each of size b, to cache X, Y, and Z. For simplicity, we assume that the input arrays X and Y have sizes a multiple of b, and that reading past the end of either X or Y returns values oc as in the studio. "mod is the integer modulo operator (% in Java). MERGE X, Y, Z) i-0 READ X, 0, A) READ(Y, 0, B) while Ali mod b