Make change optimally(this problem can't be solved with a greedy approach) Input: The array contains denominations of the coins you have available, paid is what the customer paid, and worth is what the item is worth. The customer will always pay more than what the item is worth. Output: Output the minimum number of coins you need to make change with the coins you have available.