Python recursion - Draw the recursion tree that represents the execution process, and the cost of each call. And state the asymptotic runtime for each:

You are given 2 implementations for a recursive algorithm that calculates the sum of all the elements in a list (of integers): def sum lstl (lst) if (len (lst) -1): return lst[0] else: rest sum lstl (lst[1:]) sumlst[0] + rest return sum def sum_ st2 (1st, low, high): if (low- high): return lst[low] else: rest - sum lst2 (lst, low + 1, high) sumlst[low] + rest return sum