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] := largestPossibleInteger;

array2[count2+1] := largestPossibleInteger;

index1 := 1;

index2 := 1;

for index3 := 1 to count1+count2 loop

if array1[index1] < array2[index2]

then

array3[index3] := array1[index1];

add 1 to index1;

else

array3[index3] := array2[index2];

add 1 to index2;

end if;

____________

Using the console32 or console64 framework, write a program to implement this design. Test your program with the following data (but also test with other data).

array1 DWORD 3, 5, 10, 15, 18, 15 DUP (?)

array2 DWORD 12, 7, 0, 9, 16 DUP (?)

array3 DWORD 40 DUP (?)