3. What can you say about the space requirements of each? Pseudocode for one version of a List input to mergesort follows: List mergesort(List inlist) if (inlist.length() > void mergesort(E[] A, E[] temp, int I, int r) int i, j, k, mid = (1+r)/2; // Select the midpoint if(I=r) return; // List has one element if (mid-1) >= THRESHOLD) mergesort(A, temp, l, mid); else inssort(A, I, mid-H+1); if (r-mid) > THRESHOLD) mergesort(A, temp, mid+1, r); else inssort(A, mid+1, r-mid); // Do the merge operation. First, copy 2 halves to temp. for (i=1;i> void mergesort(E[] A, E[] temp, int I, int r) int i, j, k, mid = (1+r)/2; // Select the midpoint if(I=r) return; // List has one element if (mid-1) >= THRESHOLD) mergesort(A, temp, l, mid); else inssort(A, I, mid-H+1); if (r-mid) > THRESHOLD) mergesort(A, temp, mid+1, r); else inssort(A, mid+1, r-mid); // Do the merge operation. First, copy 2 halves to temp. for (i=1;i