Provide an algorithm for the coin exchange problem were the coin values are

powers of $3.$ The first is $3^0=1.$ The second is $3^1=3.$ The third is $3^2=9$ and so on$.$All powers of $3$ can be used, and if needed more than once.

Remarks: In all the algorithms, always explain their correctness and analyze their com$-$plexity. The complexity should be as small as possible. A correct algorithm with largecomplexity, may not get full credit.ll powers of $3$ can be used, and if needed more than once.