How can I write a recursive algorithm on maple wich gives me the fibonacci polinomies knowing that: F1(x) = 1 F2(x) = x Fn+1(x) = xFn(x) + Fn−1(x), n = 2, 3, ... i think it's easy but still can't do it...if anyone knows help me please