I want a solution to this question in javascript as I am new to coding. Below is my attemp but it is not working. Question; Write a function that counts how many different ways you can make change for an amount of money, given an array of coin denominations. For example, there are 3 ways to give change for 4 if you have coins with denomination 1 and 2: 1+1+1+1, 1+1+2, 2+2. The order of coins does not matter: 1+1+2 == 2+1+1 .Also, assume that you have an infinite amount of coins.Your function should take an amount to change and an array of unique denominations for the coins: countChange(4, [1,2]) // => 3

my code attempt,but not working;

function countChange(coins, money) {
var m = money;
var n = coins.length;
var dp = Array(m + 1).fill().map(() => Array(n).fill(0));
// Fill the entries for money = 0
for (var i = 0; i < n; i++)
dp[0][i] = 1

for (var i = 1; i <= m; i++) {
for (var j = 0; j < n; j++) {
// Count of solutions inculding coins[j]
var x = i - coins[j] >= 0 ? dp[i - coins[j]][j] : 0
// Count of solutions excluding coins[j]
var y = j > 0 ? dp[i][j - 1] : 0
dp[i][j] = x + y
}
}
return dp[m][n - 1]
}
console.log(countChange);

Lemme sleep and come back in the morning first

The solution is right, but you need to pass necessary parameters to the "countChange" function.