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 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 W
(C) Identify subproblems and their dependencies based on item 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:

1. A(C), (D), (A), (E), (B)
2. B(D), (C), (A), (E), (B)
3. C(A), (C), (D), (E), (B)
4. D(D), (A), (C), (E), (B)

Pick an option to check yourself, or open the answer below.