Write a complete C++ program that does the following: 1. The program will contain 4 functions: a. Function Fibonacci(int n) calculates the nth Fibonacci number b. Function isPrime(int n) checks if n is a prime number. c. Function number(int n) that prints the numbers in sequential order based on number passed in. For example if n = 6, the output would be 123456. d. Function spaces(int n) that prints the n copies of spaces 2. The main program should utilize the Fibonacci(int n) and isPrime(int n) to print o ut the first 6 Fibonacci numbers that are also prime. 3. The main program should call the spaces and number function to create the diagram of below. Diagram 1 Diagram 2 Diagram 3 Diagram 4 1 12345 1 12345 12 1234 123 1234 123 123 12345 123 1234 12 123456 7 12 12345 1 123456789 1