Using C++

(Fibonacci Series) (100 points) A Fibonacci series is determined by its main property 1. each member of the series is equal to the sum if its two predecessors xk-k-2 +Xk-1 (the first two members x,,x, can be assigned arbitrarily. For example, in the classical Fibonacci series = x2-1. One interesting property of a Fibonacci series is that the ratio of the values of adjacent members of the series approaches a number called "the golden ratio" or ~ 1.618 (this is a unique number, its powers ,, 2.0 establish a Fibonacci series, so vk 2 : --2 -1, and -1 --I ~ 0.618 is commonly known as "the golden section"). Design a program that accepts the first two numbers of a Fibonacci series as user input and then generates additional values in the series until the ratio of adjacent values converges to within 0.001, which means that the process should be stopped when the following condition holds k-1 where x,.x,, r^,...l-,,x^-i,.r,... is a Fibonacci series. You should store all members generated in a dynamic array and then print out at the console window the number (quantity) of the series members generated out, all members generated (you should print then from the array) Hint: se a while loop to generate your series, say FibSeries, to store the series members generated)