$($a$)$ Show that, in the coins$-$in$-$a$-$line game, a greedy strategy of having the first player, Alice, always choose the available coin with highest value will not necessarily result in an optimal solution $($or even a winning solution$)$ for her.