The nature of simulating nature: A Q&A with IBM Quantum researcher Dr. Jamie We've added a "Necessary cookies only" option to the cookie consent popup. Recursive solution code for the coin change problem, if(numberofCoins == 0 || sol > sum || i>=numberofCoins). While amount is not zero:3.1 Ck is largest coin such that amount > Ck3.1.1 If there is no such coin return no viable solution3.1.2 Else include the coin in the solution S.3.1.3 Decrease the remaining amount = amount Ck, Coin change problem : implementation#include int coins[] = { 1,5,10,25,100 }; int findMaxCoin(int amount, int size){ for(int i=0; i