c) Given an array A of integers of length n, partial sums of its items are to be computed in a new result array of the same length: Ri]- sum of integers Ajo through All So, for instance, if A is 1.5.3.6.2), then R would be [1.6,9,15.17] (Array A is NOT modified) Writs the fastest algorithm. What is the worst case big O running time? int total = 0; create emply array of some lesth total +=A[i]; R] = total; the big O is On) 6 d) An array of length n holds student scores on an exam. Scores are 0.100, in multiples of 5. You need to compute the number of students for each possible score (i.e. how many scored 0. 5, 10, 15... 100). Write the fastest algorithm (use extra storage space if needed). What is the worst case big O running time int num for (int i = 0; i