Let $d_i=b^{i-1}$ for some integer $b>1,$ and $1in,$ i$.$e$.d=(1,b,b^2,$dots,$b^{n-1}).$ Does the

greedy strategy always produce an optimal solution in this case? Either prove that it does, or

give a counter$-$example.