Greedy Algorithm may not yield Maximum Weight

Theorem
Let $S$ be a finitie set.

Let $\mathscr F$ be a hereditary set of subsets.

Let $w : S \to \R_{\ge 0}$ be a weight function.

Then the maximal set $A_0 \in \mathscr F$ selected by the Greedy Algorithm may not have maximum weight.