Study the recursive implementation of Chebyshev polynomials, co... | Filo

SOLVED:Chebyshev polynomials are defined recursively and separated into two kinds: first and second. Chebyshev polynomials of the first kind, Tn(x), and of the second kind, Un(x), are defined by the following recurrence relations: Tn(x)= 1 if n=0, x if n=1, 2 x Tn-1(x)-Tn-2(x) otherwise, Un(x)= 1 if n=0, 2 x if n=1, 2 x Un-1(x)-Un-2(x) otherwise. Write a function mychebyshevpoly 1(n, x) where the output y is the nth Chebyshev polynomial of the f