1. Write an enhanced menu driven GPA calculation program that wil input a Course Grade (integer in the range 0 to 100) from the user and prints out the relevant Grade Points (in the range 0 to 4) of that student using the following Point Grades are calculated based on Sheridan's Grade Point Averages (GPAs), as published in http://myotr.sheridancollege.ca/gpa.html a. program will the following functions i. int inputGrade0; II a function that prints out a message to the user, then inputs the course grade b. The as integer form the user and returns it. ii. float calculateGPA (int grade); I this function wll receive the Course Grade as an argument, use conditional operator (expl ? exp2 : exp3) to calculate the relevant Grade Points according to Sheridan's GPA table, and returns the calculated Grade Points. ii. void printGPA(float gpa); I/ a function that received GPA as an argument and prints it out to the user properly (with a proper message) mainO function that will call the three functions above inside a do-while loop, until a sentinel value that is out of the grade range (0-100) is input. iv. 2. Recursion is a technique in which a function calls itself, for example. To solve a problem using recursion you must first express its solution in recursive form (stop condition and recursive call), as follows: A Stop Condition - the function returns a value when a certain condition is satisfied, without a further recursive call a. b. The Recursive Call - the function calls itself with an input which is a step closer to the stop condition The Fibonacci sequence is, by definition, the integer sequence in which every number after the first two is the sum of the two preceding numbers. The first two numbers of the series are 0 and 1. So the first 13 terms of the series are: 0, 1, 1,2, 3. 5, 8, 13, 21, 34, 55,89, 144 Write a program that will input a number n from the user and outputs the nth term of the Fibonacci series, using