. Make a assembly masm irvine 32 program that uses arrays of randomly ordered integers.

Make a modified version of a "swap" procedure

Write a loop that starts from the outside and moves inwards, exchanging every other consecutive pair of integers in the array

Use "Chapter 8" style input limitations

Make sure all registers are put back to their original status when done

You must assume that there will be a multiple of 4 number of elements in your array (4, 8, 12, ...)

Test your program as much as you can

Example

1 2 3 4 5 6 7 8

1 and 8 swap to become 8 2 3 4 5 6 7 1

2 and 7 are not swapped

3 and 6 swap to become 8 2 6 4 5 3 7 1

4 and 5 are not swapped

8 2 6 4 5 3 7 1