I want a flowchart for this

For the required question, the correct answer will be -

.386

.model flat,stdcall

.stack 4096

ExitProcess PROTO, dwExitCode:DWORD

.data

array DWORD 0,2,5,9,10

result DWORD 0

.code

main PROC

mov ecx, LENGTHOF array

mov ESI, OFFSET array

L1:

MOV EAX,[ESI]

MOV EBX,[ESI+4]

SUB EBX,EAX

ADD result,EBX

ADD ESI, TYPE array

Loop L1

INVOKE ExitProcess,0

main ENDP

END main

Working: - Set the offset for proper incrementation. - Set count to the length, count is not technically needed as the length could be moved directly into the register. - Move the first value into the eax register. - Inc to get the next value, and also for the next loop. - Move that value into the ebx register. - Get the difference between the two values. - Add the difference to the running total. - At the end, Total = A, or 10.

The following exercises may be completed in either 32-bit mode or 64-bit mode. + 1. Converting from Big Endian to Little Endian Write a program that uses the variables below and MOV instructions to copy the value from bigEndian to littleEndian, reversing the order of the bytes. The number's 32-bit value is under- stood to be 12345678 hexadecimal. .data bigEndian BYTE 12h, 34, 56h, 78h littleEndian DWORD? ** 2. Exchanging Pairs of Array Values Write a program with a loop and indexed addressing that exchanges every pair of values in an array with an even number of elements. Therefore, item i will exchange with item i+1, and item i+2 will exchange with item i+3, and so on. ** 3. Summing the Gaps between Array Values Write a program with a loop and indexed addressing that calculates the sum of all the gaps between successive array elements. The array elements are doublewords, sequenced in nondecreasing order. So, for example, the array {0, 2, 5, 9, 10} has gaps of 2, 3, 4, and 1, whose sum equals 10. ** 4. Copying a Word Array to a Double Word array Write a program that uses a loop to copy all the elements from an unsigned Word (16-bit) array into an unsigned doubleword (32-bit) array.