this is an introductory C++ course and i could really use some help with this program using relatively basic coding practices. it also really helps if there is an explanation with the code as well. I will most likely thumbs up for any help thanks :)

1,a2 In this problem, you will be computing prime numbers and Fibonacci numbers. A positive integer is a prime number if it has exactly two divisors, 1 and itself. (Note that 1 is not a prime number.) The first 5 prime numbers are 2, 3, 5, 7, 11. The Fibonacci numbers are defined by ai = = 1 and an = an-1 tan-2 for n > 3. The first seven Fibonacci numbers are 1,1,2,3,5,8, 13. Your program should ask the user for a positive integer N and then output the Nth Fibonacci number and Nth prime number If the user enters 5, the output of your code should exactly match what's shown below. (Don't forget the period at the end of the line.) Example output: Enter a positive integer: 5 The 5th Fibonacci number is 5. The 5th prime number is 11. example, the user enters 2, it is okay if your code says "2th" rather than "2nd". You may assume that the user enters valid input and you do not need to worry about if they enter a number N so large that the N-th prime number or N-th Fibonacci can't be stored as an int. Note: Different textbooks define the Fibonnaci sequence slightly differently. For this problem, you should use the definition given above