no need to use any programing language.

2 Missing Numbers (a) Let A be an unsorted, length-n-1 array of integers with no duplicates, where each element of Ais in the range (1,...,n). Notice this means that exactly one of the numbers in that range does not appear in A. Give an O(n)-time, O(log n)-space algorithm to determine the missing number (b) OK, different scenario: Let A be an unsorted, length-n array of integers. Let All + + And be the sum of all the numbers in the array. S is a length-n array (initially all zeros) whose values you will compute and fill in. Given A, your task is to fill in all S's entries, for each Isisn, according to the following equation: S[i] = 3 - A[i] = A[1] + ... + Ali - 1] + A[i+1] + ... + A[n] That is, each S[i] should be set to the sum of all the numbers in A except A[ Give an O(n)-time / O(n)-space algorithm to compute all the elements of S. (To be clear, the On) time limit is for the entire process of filling in all n of S's entries.)