Complete the extract below by dragging the appropriate item into each box. The key aspect which makes a function recursive is that each recursive call the problem in some way. On each recursive call the current of the function (the values of its local variables and arguments) is on the call Any recursive function must have a and must also call continuous loop | non-termination stack expands reduces discarded state iteration loop transmitted obliterates strengthens reuses itself line recorded repeatedly base case