Question 19 (2 points) Assume a correct implementation of static void merge (int[] numbers, int i, int j, int k) { from the zyBook, where index variable j is used to divide the list into two halves, elements from i to j are in the left half, and elements from j + 1 to k are in the right half. Here is a partial implementation: static void merge (int[] numbers, int i, int j, int k) { int mergePos = 0, leftpos = i, rightpos = j + 1, int[] mergeNumbers = new int[ /* ??? */ l; while (/* ??? */) { if (numbers [leftPos]