1. (8 points) Write a MIPS assembly language program which implements the following pseudocode:
   
   i = 0

   for num = x to y counting by 5

   ar[i] = num

   i = i + 1

   For your implementation, x is stored at the address in a0, y is at a0+1, and ar begins at a0+2 and continues for as many bytes as necessary. The outcomes of an example run are below:
   
   x=0, y=10, ar={0, 5, 10}

2. (8 points) Write a 6502 assembly language program which implements the following pseudocode:
   
   i = 0

   for num = x to y counting by 5

   ar[i] = num

   i = i + 1

   For your implementation, x and y are stored in the first and second bytes of the zero page, ar starts at the third byte of the zero page and continues for as many bytes as necessary. The outcomes of an example run are below:
   
   x=0, y=15, ar={0, 5, 10, 15}