Need just few changes in the solution to make it looks not copy and past, so it will be accept it by proffesor! Assembly

Write a complete MIPS-32 assembly language program to find the sum of all integers stored in an array of size 15. Assume that the array is saved in memory address "Array 15". Store the sum in the memory location right after the end of the array "Array15". data Array 15: word 1,2,3, 4, 5, 6, 7,8,9, 10, 21, 22, 23, 24, 25 .text .globl main main: la Sa0, Array15 # Load address pointer # Clear sum # Initialize loop counter li $t, 15 op: lw $12, 0(Sa0) addu $t0, St0, $12 # $t2 = Merna) addiu $a0, Sa0, 4 addiu Stl, Stl,-1 bgtz Stl, loop # Inc. address pointer # Dec. loop count # if ($t l > 0) branch # Store the result # End program li SvO, 10 syscall