def player(l, cache=None):
    n = len(l)
if cache is None:
    cache = [-1] * (n + 1)
if cache[n] < 0:
    cache[n] = min(player(l[:-1], cache), player(l[:-2], cache)) + l[-1
        ] if l else 0
return cache[n]
Need Help Writing Recursive function that find cheapest route through a list of numbers