We compare a greedy solution to the coin changing problem against the dynamic programming solution provided in the previous module. We study cases where greedy algorithms turn out to be optimal: ...