The recurrence relation in the previous problem solves the 0-1 knapsack problem in a dynamic programming manner by filling the table of $V[i][j]$. Which of the following statements is correct about the running time of this algorithm?