Consider two sets of integers, X = [x, x2, n] and Y= [y, 92, ..., yn]. Write two versions of a FINDUNCOMMON(X, Y) algorithm to find the uncommon elements in both sets. Each of your algorithms should return an array with the uncommon elements, or an empty array if there are no uncommon elements. You may make use of any algorithm introduced in the lectures to help you develop your solution. That is, you do not have to write the 'standard' algorithms - just use them. Therefore, you should be able to write each algorithm in about 10 lines of code. You must include appropriate comments in your pseudocode. (a) [2 Marks] Write a pre-sorting based algorithm of FINDUNCOMMON(X, Y). Your algorithm should strictly run in O (n log n). (b) [2 Marks] Write a Hashing based algorithm of FINDUNCOMMON(X,Y). Your algorithm should run in O(n).