E. insert first(item, L): returns a mylist that contains item followed by items in L, in sequence.
From EECS 182
E. insert first(item, L): returns a mylist that contains item followed by items in L, in sequence.
- Best to solve recursively. Since it is trivial to solve if L1 is empty.
def insert_first(item, L1):
if (L1.isempty()):
return L1.append(item)
else:
return insert_first(item, L1.pop()).append(L1.last())
