2) (40 points) Consider the following algorithm which takes an array A[O n -1] of n elements: Algorithm Mystery answer true fori0 to n 1 do forj 0 to n-ido if i j and A [f] = AU] then answer-false return answer a) What does this algorithm compute (in other words, what problem does it solve)? b) What general algorithmic design technique is it based on? c) What is the algorithm's basic operation and how many times is it executed? Justify your answer. d) Outline or pseudocode a more efficient algorithm for this problem and indicate its complexity