7. Suppose that array1 and array2 are arrays of doublewords, each sorted into increasing order. Assume that there are count1 values in array1 and count2 values in array2, with at least one unused slot in each array following the significant values. Assuming 1-based array indexing, here is a design for merging the numbers from the two arrays into a new sorted array3. array1 [count1+1] := largest possibleInteger; array2[count2+1] := largest possiblelnteger; index1 = 1; index2 = 1; for index3 := 1 to count 1+count2 loop if array1[index 1]