You have an unlimited number of stamps worth $42ct,20ct,8ct,3ct$ and

$2$ct at your disposal

a$)$ Use the greedy algorithm to select how the following values are displayed:

$60ct,70ct,85ct$

b$)$ Implement the greedy function, which calculates a solution using a greedy

algorithm. Exit with throw runtime$\_$error if no solution is found

c$)$ For which of the values from a$)$ are there solutions for which fewer marks could

be used for the representation than with the greedy algorithm? State the better

solution$($s$)$ and the algorithm that calculates them.

d$)$ A function is given that calculates the largest n$-$digit number with the sum of the

digits of $q.$ The function bigint pow$($int $x,$ int $y)$ calculates $x^y.$

Realize the algorithm using a recursive function so that the parameter $n$ is reduced

by one in each recursive call.