Your algorithm can use any algorithm and data structure that we learned in class. You are given an array of n integers. Design an algorithm Find A - Pair to find all unique pairs of elements (x, y) whose summation is S. Your algorithm must run in O(n log n) time. You are given multiple arrays of strings, where different string may have different numbers of characters. Design an algorithm Make-A-Set running in O(n log n) time, where the algorithm returns an union set of strings by combining all arrays and removing any duplicates. Suppose we have an array of n positive integers range from 0 to n - 1. Design an algorithm that sorts the array in O(n) time