Write 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 z and y in A that minimize -yl, where r -yl denotes absolute-value(x-y)