A currency has only pennies and nickels. Prove that the greedy algorithm yields the optimal $($minimal$)$ number of coins for each total currency x $.$ Note: This is a proof, meaning your answer should involve calculations and full sentences which the grader can follow and which support your argument. Your answer should not simply be calculations! Use proof by contradiction and make sure to keep it general