Problem 5. Given an array, A, of n - 2 unique integers in the range from 1 to n, we want to develop an algorithm, taking O(n) time for finding the two integers i, j in the range from 1 to n that are not in A. You may use only 0(1) space in addition to the space used by A. (1) Let's assume that we have given n and the sum (s) of A, where s= (1 k) -i-jand square sum (ss) of A, where ss = (-1 k)-12-j. Then, describe your algorithm to find out two distinct integers i, j. =1 V (2) Based on your algorithm developed in (1), find two distinct integers i,j if n is 10, s = 45, and ss-333.