Using the denominations 1, 3, and 4, a greedy coin-change algorithm repeatedly takes the largest coin not exceeding the remaining amount. For amount 6, what result does it produce, and why is it not optimal?