The recitation problem Merge Two Sorted Arrays (code below) merges the two sorted parameter arrays // nun and num2 are integer arrays that are already sorted in increasing order. m and n are the number of items in the arrays, respectively. // numi length is m + ni public void merge(int[] nunsi, int m, int [] nums2, int n) { int im- 1; int jun. 1; int kmn - 1; while ( 1 ) && 1 > { int one = nums1[1]; int two - nums 2[3]; if ( one >= two ) { numsi[k] - one; K- } else { numsi[k] - two; k; 1.-; } while ( - ) { nunsi[k]. nums 2/3--); } Assuming that . (first array number of items) is 3 and n (second array number of items) is 5 give one example of the best-case scenario, where merge executes the least number of if- conditional to merge the two arrays. For example, one example of the worst-case scenario is when the first array is [2,5,9,0,0,0,0,0] and the second array is [13,4,6,8). The call would be merge([25.90,0,0,0,0.3. 11.3.4.6,8], 5)