Write a function in Pseudo$-$Python that completes the following task.

You are given a recurrence relation input as a list of coefficients. For example the RR written as

$a_n-2a_{n-1}-3a_{n-2}+12a_{n-2}$ would be input as $[2,-3,12].$ You are also given the function poly$\_$solve

that solves any polynomial. It takes as input the coefficients of a polynomial, and outputs the list of the

roots. For example, the polynomial $x^2+5x+6$ has roots $x-2,3,$ and would be called and outputted

as follows:

$pol{y}_s$olve $([1,5,6])=[2,3]$

Write a function that takes as input a recurrence relation and outputs the General Equation of the

closed form of the recurrence relation to the standard output $($ie$.$ printed$)$i$9,$ using the coefficients c$\_1,$

c$\_2,....$ You should not solve for the roots of any polynomial yourself, and only call this magical function.

Note: Your code will be graded as if it were hand written code, so it is not expected to run perfectly,

although should be an approximation of correct and accurate code. Your code must be typed in either:

an IDE, Text Editor, or LaTeX directly. You should have one main function only. This should NOT be

a full program. Code Line Maximum of $30$ lines. You will be docked marks for not following these

requirements.