Arrange the following steps in the correct order to solve the Knapsack problem using Dynamic Programming.

(A) Define the base case when the capacity is zero $(0)$ or no items are left to consider
(B) Compute the maximum value that can be obtained using items up to the $i$-th item and a knapsack capacity of $0$
(C) Identify subproblems and their dependencies based on items weights and values
(D) Initialize a table to store results of subproblems
(E) Iterate through each item and each possible capacity to fill the table

Choose the correct answer from the options given below :