The difference between Dynamic Programming and Divide & Conquer is that the first is computed from the bottom up$,$ and the second from the top down:

Group of answer choices

Order the items by cost starting with least cost, and deliver each item as late as possible but before deadline

Order items by cost starting with greatest cost, and deliver each item as late as possible but before the deadline

Use the knapsack problem to organize the items, where the weights are the costs and the capacity the sum of deadlines

Deliver the items in the order of costs, starting with the costliest item first; ignore items that cannot be delivered on time