Let $1=1$ and $2<=+1$ for $1<=<=1.$ Does the greedy strategy always produce an optimal solution in this case? Either prove that it does, or give a counter$-$ example.