3. (15 points) Use iteration (as done in class) to solve the following recurrence relation: F(n) = F(n-1) +n-1 forn > 1 F(1) = 2 Hints: 2,m-i = 20 m . There are formulas for many common summations: https://en.wikipedia.org/wiki/Summation 4.(15 points) Write a function that takes a single, integer parameter n. This function should dynamically allocate an integer array of size n. It should then fill the arrays with the first n numbers in the Fibonacci sequence and return the array pointer. Write a second function that takes such an array pointer, deallocates the memory associated with it, and sets the pointer to nullptr (in such a way that it becomes nullptr in the calling method)