When a top-down approach of dynamic programming is applied to a problem, it usually _____________ Decreases both, the time complexity and the space complexity Decreases the time complexity and increases the space complexity Increases the time complexity and decreases the space complexity  Increases both, the time complexity and the space complexity

In some cases, increasing the _____ of an algorithm can reduce its time complexity but at the cost of increased space usage.AmodularityBrecursionCparallelismDmemory consumptionlogo

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

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

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

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