If a problem can be broken into subproblems which are reused several times, the problem possesses ____________ property. Options Overlapping subproblems Optimal substructure Memorization Greedy

If a problem can be broken into subproblems which are reused several times, the problem possesses ____________ property. Options Overlapping subproblems Optimal substructure Memorization Greedy

If an optimal solution can be created for a problem by constructing optimal solutions for its subproblems, the problem possesses ____________ property.1 pointOverlapping subproblemsOptimal substructureMemoizationGreedy

In top-down design, the problem is broken down into ____________ subproblems.

Which of the following is/are property/properties of a dynamic programming problem?1 pointOptimal substructureOverlapping subproblemsGreedy approachBoth optimal substructure and overlapping subproblems

Which of the following is not a characteristic of dynamic programming?Overlapping subproblemsOptimal substructureRecursionDivide and Conquer