Please give the pseudo code for the following algorithm and the time complexity.

a. Give an algorithm that computes the minimum number of coins required to give K cents in change.

b. Give an algorithm that computes the number of different ways to give K cents in change.

Note:

1.The number of coins is unlimited.

2.Please also provide clear comments to help understand the algorithm

3.Do not provide an algorithm with Exponential Time