Write a MIPS program that stores two arrays A, B in memory based on the below rules: (15 points) - Array A location in memory is at address 0x0100 in memory - Array B location in memory is at address 0x0200 in memory - The content of Each array is its index o i.e. A[i] =i, B[j] = j - Array A will advance forward in memory - Array B will advance Backward in memory - The process continues until all location between the starting address of Array A and starting address of array B are filled with the respective indices. o Remember each Array should not overwrite each other