Consider an array of numbers A(i,j), where i = 0 through n - 1 is the row index, and j = 0 through m - 1 is the column index. The array is stored in the memory of a computer one row after another, with elements of each row occupying m successive word locations. Assume that the memory is byte-addressable and that the word length is 32 bits. Write a subroutine for adding column x to column y, element by element, leaving the sum elements in column y. The indices x and y are passed to the subroutine in registers R1 and R2. The parameters n and m are passed to the subroutine in registers R3 and R4, and the address of element A(0,0) is passed in register RO. Any of the addressing modes in Table 2.1 can be used. At most, one operand of an instruction can be in the memory.

LO1