. Consider the following optimisation problem: n max i=1 (1) n s.t. Willi SW, li {0,1} for all i, i=1 where pi and Wi are nonnegative real numbers for all i = 1, ..., n, and W is a nonnegative real number. Describe an independence system, for which problem (1) can be posed as the combinatorial optimisation problem associated with this independence system. Is this independence system a matroid (in general)? Can this combinatorial optimisation problem be solved by the Greedy algorithm (in general)? Give your arguments