In C++ and text form please.

Directions: Given a degree 2 recurrence relation a_n = ca_n-1 + da_n-2 and two initial conditions: a_0 and a_1, where c^2 + 4d greaterthanorequalto 0, find the closed (explicit) formula for the sequence. Inputs c, d, a_0, and a_1 (where c^2 + 4d greaterthanorequalto 0) output: the closed form expression Extra Credit: Add a feature to be able to calculate a_n for a given n. Add a feature to be able to start at any index i (ie: given a_1 = 2 and a_2 = 4)