Write a method named Collapse that accepts an array of integers as a parameter and returns a new array where each pair of integers from the original array has been replaced by the sum of that pair.
For example, if an array called a stores {7, 2, 8, 9, 4, 13, 7, 1, 9, 10}, then the call of Collapse(a) should return a new array containing {9, 17, 17, 8, 19}.
The first pair from the original list is Collapsed into 9 (7 + 2), the second pair is Collapsed into 17 (8 + 9), and so on.
If the list stores an odd number of elements, the last element is not collapsed.
For example, if the array had been {1, 2, 3, 4, 5}, then the call would return {3, 7, 5}.
Your method should not change the array that is passed as a parameter.
