Aim of the experiment

1. To implement and visualize the Greedy Algorithm for the Coin Change Problem and observe its step-by-step coin selection process for a given amount.

2. To compare the greedy solution with the optimal Dynamic Programming solution, in order to analyze cases where the greedy approach fails and the optimal method provides a better solution in terms of minimum number of coins.