Given an unlimited supply of coins of denominations, we wish to make change for a value ; that is, we wish to find a set of coins whose total value is . This might not be possible: for instance, if the denominations are and 10 then we can make change for 15 but not for 12. Give an dynamic-programming algorithm for the following problem.Input:,; .Question: Is it possible to make change for using coins of denominations ?

Dynamic programming is a paradigm used for writing algorithm which helps to solve some particular type of problems more efficiently by saving the solution of subproblems and using them to get the final solution. Rather than performing the same calculation again and again, the optimal solution to subproblems are calculated and stored.

Consider$D\left(u\right)$ as sub-problem such that $u=\left\{1,\dots .,v\right\}$.

Thus, according to question,$D\left(u\right)$ is true if it is possible to make change for v using coins denomination.$x_1,x_2,\dots x_n$

$D\left(u\right)=\left\{\begin{array}{c}TRUE;\text{ifitispossibletomakechangefor}v\\ \text{FALSE};\text{otherwise}\end{array}\right.$

Now, taking$D\left(u\right)$ as sub-problem, if it is possible to make change for$v$ using denomination,$x_1,x_2,\dots x_n$then it is also possible to make change for by using same denomination with the coin.

The desired recursion is:

Here, ‘’ is the value for which we finding denomination.