Please help

Description: You are to implement a program that will demonstrate complex number operations. Then, use complex number for the following recursive function: f(n, c) = f(n-l, c)*f(n-1, c) + c, and f(O, c) = c; where c is a complex number with two doubles (oating point numbers, x and y). As you can see, u is the size (integer), and f(n, c) is a complex number (with two doubles). Please get \"11\" and \"c\" from the keyboard, calculate f(n, c), and display f(n, c) if abs_comp1ex(f(n, c))