DQuestion 3 1 pts Below is pseudocode that implements a dynamic programming implementation to find the most profitable solution for the rod-cutting problem. for j-1 to n: q- min.int for i-1 to j: What does the variable j represent? O The size of the rod in each subproblem O The number of cuts made to the rod in each subproblem O The maximum number of cuts possible to the rod O The revenue produced by cutting the rod