Recall the definition of optimal substructure and how it applies to dynamic programming solutions.

Consider how the solution to a problem of size n can be constructed from solutions to smaller subproblems in the weighted independent set problem.

Analyze the recursive case of the DP solution for the weighted independent set problem and prove that the optimal solution for a problem of size n includes the optimal solutions to its subproblems.