Dynamic Programming·Memoisation·FoundationWhat goes in the notebookA memo is added to a recursive function.What does it store?AThe answer for each set of arguments already computedBThe arguments that have been seen, so repeats can be skippedCThe whole call stack, so it can be replayedDThe final answer, so the function can return early next timeCheck answer