Greedy methods guarantee an optimal solution when:

Greedy methods guarantee an optimal solution when:

1. a) Overlapping subproblems exist
2. b) problems have optimal substructure and greedy choice property
3. c) divide and conquer can be applied
4. d) Subproblems are independent