Question: $6$

I need step by step answer for my better understanding

Which of the following is true about dynamic programming?

A$.$ It is a bottom$-$up approach

B$.$ It is a top$-$down approach

C$.$ It is used for divide$-$and$-$conquer problems

D$.$ It is always less efficient than greedy algorithms

If You Write AI Answer $-$ I will give $15$ Dislikes For Sure.