Problem 1. Assume you have an array A1.., n], where every value is an integer between 1 and n, inclusive. You do not have direct access to the array A. You do have a function equal(i,j) that will return TRUE if Ai ALj], and FALSE otherwise. (a) Give a quadratic (en*) algorithm that counts the number of pairs (A[i],AJ) (i j) such that AM-Aj]. The algorithm can only use a constant amount of extra memory. Just give the "brute force" algorithm. (b) Analyze exactly how many times the algorithm calls equal(i,j) (as a function of n) Justify