Minimize cost of recursive pairwise sums: how to prove the greedy solution works?

Question

The problem is in this other question.

Why does this always work? It's not clear to me how one would use induction.

For $n = 3$, a quick calculation shows it works, however, I don't think it generalizes well.