Target Sum 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.
- paired with the lowest number are first in the array
-the numbers within the pair are also sorted
For 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] ]
Hint: Try sorting the original array first.
// Input for the parameter
numbers ===> [9, 2, 10, 1, 5, 3, 3]
target ===> 12

function findUniquePairs ( numbers, target ) {
}
Can you please solve this problem in JavaScript with and without built-in methods? And explain the concept of your approach? Thanks in advance!