Which algorithm uses the optimal substructure approach in top$-$down fashion to find the solution to sub$-$problems?

Answer Choices:

a$)$ Greedy Algorithm

b$)$ Dynamic programming algorithm

c$)$ Bellman Ford Algorithm

d$)$ None of these