Create a Linux-based 32-bit assembler language program (NASM) which:

Define three arrays, each of which contains single byte values

Array 1 contains (unsigned): 10h, 30h, F0h, 20h, 50h, 12h

Array 2 contains (unsigned): E0h, 40h, 22h, E5h, 40h, 55h

Array 3 contains (unsigned): all zeros Define three more arrays, each of which contains double word values

Array 4 contains (unsigned): 11BDh, 3453h, 2FF0h, 6370h, 3350h, 1025h

Array 5 contains (unsigned): FFFh, C3Fh, 22FFh, EF53h, 400h, 5555h

Array 6 contains (unsigned): all zeros 1

In a loop (ecx as the loop counter), add the contents of our Byte Array 1 to Array 2, store each value into Array 3. Use indirect operands to traverse the array. Use the esi register as your indirect position register (use the ah and al registers for each addition since these are single byte values

Put the summed values in reverse order in the third array. Example: 10h + E0h (first positions in Array 1 and array 2) should go into the 6th position of the third array.

In a loop (ecx as the loop counter), add the contents of our Double Word Array 4 to Array 5, store each value into Array 6.

Use indexed operands to traverse the array. (use the eax and ebb registers for each addition since these are double word values)

Put the summed values in forward order in the sixth array. Example: 11BDh + 0FFFh (first positions in Array 4 and Array 5) should go into the 1st position of Array 6