I need this done in c++ please

Output is shown in description

Project 2: Fibonacci-like Sequences [SEQ] Textbook Section: 4.23 Directions: Given a degree 2 recurrence relation an -C1an-1 + c2an-2 and two initial conditions ao and ai , where c + 4c2 > 0, find the closed (explicit) formula for the sequence. (Hint: you will need to consider two cases: real and repeated roots.) Input: C1 , C2, ao. and ai (you will need to check ite + 4C2 0) Output: the closed formula expression for an Extra Credit: Add a feature to be able to calculate the value of an for a given n Add a feature to be able to start at any index i (ie: given a2 and a2 4) Be able to run the program with imaginary roots (ie: if c 4c2 0, find the closed (explicit) formula for the sequence. (Hint: you will need to consider two cases: real and repeated roots.) Input: C1 , C2, ao. and ai (you will need to check ite + 4C2 0) Output: the closed formula expression for an Extra Credit: Add a feature to be able to calculate the value of an for a given n Add a feature to be able to start at any index i (ie: given a2 and a2 4) Be able to run the program with imaginary roots (ie: if c 4c2