1(I)1. Construct a Fibonacci-class which simulates a Fibonacci number. Hereby theFibonacci-class must implement a method which would return the Fibonacci numberof the sequence index (n). The...

Extracted text: Questions 3) In mathematics, the Fibonacci numbers, commonly denoted F., form a sequence called the Fibonacci sequence, such that each number is the sum of the two preceding ones, starting from 0 and 1. That is, n =0 F.= F(n) ¬ 1 n = 1 F(n-1)+ F(n-2) n>1 (I) 1. Construct a Fibonacci-class which simulates a Fibonacci number. Hereby the Fibonacci-class must implement a method which would return the Fibonacci number of the sequence index (n). The signature of the method is given as int GetValue(int n); 2. In a main file construct an object of Fibonacci-class and calculate the Fibonacci number for n= 7 by using the method GetValue(int n) ; Not: please use one header (h) and one source (cpp) file for your Fibonacci-class and note that definition of Fibonacci sequence is recursive.