3 Problem 3: rite an algorithm in pseudocode for each of following two problems below. The algorithm should be simple in both cases! Both algorithms should have running time significantly better than n2 Part 1: Closest Pair (5 points) Input: An array A with n distinct (non-equal) elements . Output: numbers r and y in A that minimize |x - y, where -y denotes absolute-value(x-y) Part 2: Remove Duplicates (5 points) . Input: An array A of size n, with some elements possibly repeated many times Output: a list L that contains the elements of A (in any order), but without duplicates For example, if A -1,3,7, 5,3,5,3,1,4 then the output set L can contairn the numbers 1,4,7,5,3 in any order