github Given an array of integer values, and a target integer number, find the unique pairs of numbers that add up to the target number. The output would be a 2D array of numbers. Make sure the pairs are sorted. Pair with the lowest number are first in the arrayThe numbers within the pair are also sortedFor example, given an array of numbers[9, 2, 10, 1, 5, 3, 3] and a target number of 12 your output should be [ [2,10], [3,9] ]