Pay attention to the following algorithm! N=integer ; A=array [1..N] of integer ; begin       input(N);       input(A);       sum:=0 ;       for i:=1 to N           sum:=sum+A[i] ;       end;       for i:=1 to N          if sum-A[i] < sum            sum:=sum-A[i] ;          end;       end;       print(sum) ; end. If the input is N = 2019, and A = [−1009,−1008,...,0,1,2,...,1009], then the output will be... a) -1 b) -509454 c) 509545 d) 0 e) -5095

Problem2: A square matrix can be represented by a two-dimensionalarray with N rows and N columns. You may assume a maximum size of 50 rows and 50 columns. 1. Write an algorithm MakeEmpty(n), which sets the first n rows and n columns to zero. 2. Write an algorithm Add(M1, M2, M3), which adds two matrices M1 and M2 together to produce matrix M3. 3. Write an algorithm Subtract(M1, M2, M3), which subtracts matrix M2 from matrix M1 to produce matrix M3. 4. Write an algorithm Copy(M1, M2), which copies matrix M1 into matrix M2.

Wrist a code to find the iterative sum of an array and the range (max and min)

Java Programming language Please help me with this question