Using the problem defined in the last two questions, assume you are solving the problem of multiplying all values in a node chain together. What would be a reasonable 'recursive step' which combines the current problem with the subproblem?

Group of answer choices

Multiply the solution from the sub problem with the result from the base case

Add the solution from the sub problem to the base case

Add the solution from the sub problem to the value stored in the Node parameter

Multiply the solution from the sub problem to the value stored in the Node parameter