• Allocate space for A and give it the initial values of 1, 3, 5, 7, 9, 11, 13, 15, 17, 19.
• Allocate space for B without initial values (in MIPS the values end up as 0).
• Output a prompt for an integer N as below: "Enter N:".
• Read in the value of N (a number between 0 and 10).
• If N is not in the range from 0 to 10 inclusive, output the message "N out of range" and terminate.
• Compute the first N values of B as the accumulation of the values of the array A (e.g. B[i] is A[0] + A[1] + ... + A[i]), as shown in the c program below. Note: You must use a loop to implement this.
• Using a separate loop output the first N values of the array B.

pandora% cat lab5.c
#include <stdio.h>
#include <stdlib.h>

void main(void)
{
   int A[10] = {1, 3, 5, 7, 9, 11, 13, 15, 17, 19};
   int B[10];
   int N;
   int OldB;
   int i;
   printf("Enter N:");
   scanf("%i", &N);
   if (N < 0 || N > 10) {
      printf("N out of range\n");
      exit(1);
   }
   i = 0;
   OldB = 0;
   while (i < N) {
      B[i] = OldB + A[i];
      OldB = B[i];
      i = i + 1;
   }
   i = 0;
   while (i < N) {
      printf("%i", B[i]);
      printf(" ");
      i = i + 1;
   }
   printf("\n");
}
pandora% lab5
Enter N:10
1 4 9 16 25 36 49 64 81 100 
pandora% lab5 
Enter N:5
1 4 9 16 25 
pandora%lab5
Enter N:0

pandora% lab5
Enter N:-1
N out of range
pandora% lab5 
Enter N:11
N out of range