Given an integer array containing the available denominations of coins in descending order, write a method to compute the number of possible ways of representing a monetary amount in cents. For simplicity, assume that there are an infinite number of coins available for each coin denomination in the array.
Use each different coin denomination and sum them multiple times to add up to the amount. 1. Declare a variable to keep track of the next coin denomination index. 2. If the current coin denomination index is equal to the last coin index, return that denomiation itself 3. Else update the next_coin_index to current_coin_index + 1 4. Start a loop - counter * coins[current_coin_index]<= amount, and sum up the recursive call makeChange(coins,amount-i*coins[current_coin_index],next_coin_index). Store it in a temporary variable. 5. Return the sum stored in the temporary variable at the end of the loop.