1. Suppose that comb is the Python function defined below. Use this function to give a proof by induction of the statement: def comb (n): if n==0: return 0 elif n==1: return 1 else: def seq(n): return comb (n-1) + n 2. Suppose that seq is the Python function defined below. Use this function to give a proof by induction of the statement: if n==0: return 1 elif n==1: return 2 For all n E N, comb (n)= else: (" + ). 2 For all n N, seq(n) = 2". return seq(n-1) + 2*seq(n-2)