A E 3- Call M-Chane A Table T E N2Xm Such That T(1, I) [O...-1] And T(2,1)E [O...-1] For I= 1, 2,...,M. This Table

 A E 3- Call M-Chaîne A Table T E N2Xm Such That T(1, I) € [O...-1] And T(2,1)E [O...-1] For I= 1, 2,...,M. This Table Represents T(M), Defined Recursively As Follows: - ? (M) = { = 1 T(T[1, I]) + T (T[2, I]) Si O

 

 

 

3- Call m-chane a table T = N2xm such that T(1, i) [0..i-1] and T(2,i)e [0..i-1] for i = 1, 2,...,m. This table represents T (m), defined recursively as follows: T (m) = { T(T[1, () + si i = 0 (T[1, i]) + t (T[2, i]) si 0 i m m } a- Give in Python program that takes as input a 2 m table and returns the integer represented if the table is an m- chane, and -1 otherwise. b- Give in Python a backtracking algorithm that on an integer k 2 as input, returns an m-chane representing k such that m is minimum.