given array of coins (int) and an int n the function need to return true if there is atleast one solution to the coin-change problem. meaning: for array of ints> 0: [c(0)
