Question

Given coins of 3 denominations i.e. C[ ] = {1,2,3) and an amount A=5, find the total no. of ways in which amount A can be
paid using coins of all 3 denominations and assume that we have an infinite supply of coins of given denominations.​

Answer 1

Answer:

 Given coins of 3 denominations i.n. C[ ] = {1,2,3) and an amount A=5, find the total no. of ways in which amount A can be paid using coins of all 3 denominations and assume that we have an infinite supply of coins of given denominations

Explanation:

pls mark me as brainlist