Write and test a MIPS assembly language program to compute and print the first 100 prime numbers. A number n is prime if no numbers except 1 and n divide it evenly. You should implement two routines:

a. test_prime (n), return 1 if n is prime and 0 if n is not prime.

b. main(), iterate over the integers, testing if each is prime. Print the first 100 numbers that are prime.