Dynamic Programming·DP on a Sequence·FoundationHow many base casesA recurrence reads best[i] = f(best[i - 1], best[i - 2]).How many base cases does it need?AOne, because every DP needs exactly one starting valueBNone at all, provided the whole table is initialised to zero before the loop startsCTwo, because the first index the recurrence can be applied to is 2DAs many as there are distinct choices at each stepCheck answer