write the code on C++ .

Project 2: Fibonacci-like Sequences [SEQ] Textbook Section: 4.23 z initial conditions Directions: Given a degree 2 recurrence relation an can-1 +dan and two ao and ar, where 4d 20. find the closed (explicit) formula for the sequence. (Hint: you will need to consider two cases: real and repeated roots. Input: c, d, ag, and (where c 4d 20) Output: the closed form expression Extra Credit: Add a feature to be able to calculate an for n given n Add a feature to be able to start at any index i ie: given ai 2 and an 1) Due Date: March 17 Revision Due Date: April 21 Project 3: The Greatest Common Divisor UGCD Textbook Section: 7.36 Directions: Implement the Euclidean Algorithm to compute the greatest common divisor of any two integers. These two numbers should be able to be positive, negative, zero, or any combination thereof. (Hint: be carefull when dealing with zero and negative numbers. Input: 2 integers Output: 1 integer (ie: the god of the given integers) Extra Credit: Find the linear combination of the 2 given integers which sums to their god. Due Date: April 1A Revision Due Date: May 1