*********These have to be answered using strong or weak induction proofs. Im really lost on this. ************

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