Which statement is true?

(A) If a dynamic-programming problem satisfies the optimal-substructure property, then a locally optimal solution is globally optimal
(B) If a greedy choice property satisfies the optimal-substructure property, then a locally optimal solution is globally optimal
(C) both of above
(D) none of above