Dynamic programming solves each subproblem only once and stores its solution to avoid redundant computations, optimizing the problem-solving process.  *1 pointTRUEFALSE

A greedy algorithm can be used to solve all the dynamic programming problems:1 pointTrueFalse

Dynamic programming algorithms satisfy the  optimal sub-structure property: An optimal solution to a problem (instance) contains optimal solutions to sub-problems. choose the correct answer a.This property is applicable to few problem onlyb.Falsec.Trued.NONE

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

What is dynamic programming in data structures?A technique for designing efficient algorithms by breacking down a problem into smaller subproblemsA way to store and organize data in a computer programA process of optimizing memory usage in a programAmethod for creating algorithms that use only constant space