The following C program reads an integer number x from the keyboard and prints whether it is a prime number. The program starts by assuming that x is prime. Then, it checks whether the number is divisible by each integer between 2 and x / 2, by checking whether the remainder of that division is 0. If so, the program immediately concludes that x is not prime. #include
int main()
{
int x;

printf("Enter number: ");
scanf("%d", &x);
// Assume prime
int is_prime = 1;
// Traverse
for (int i = 2; i <= x / 2; i++)
{
if (x % i == 0)

{
is_prime = 0;
break; }

}

// Result
if (is_prime)
printf("Prime number\n");
else
printf("Not a prime number\n");
// End

return 0; }

Required:
Write a MIPS program that reproduces the exact behavior of the given C code.