Given an array of integers and a sum, find all unique combinations in the array that equal the given sum. The same repeated number may be chosen from the array an unlimited number of times. Example: Array = [2,4,6,8] Sum = 8 Output: [2,2,2,2]; [2,2,4]; [2,6]; [4,4]; [8] If there is no solution, display a message saying there is no solution.