Here is the assignment that I need to do. How should I be approaching this? I'm a 3.8 GPA student and I fear I won't pass this C programming. S.O.S.

The goal of this assignment is to work with repetition and selection structures, with a focus on repetition. As in past assignments you will create a small calculator application, although it will not be an extension of the earlier calculators. Instead, your program should present the user with a list of options, read the user's input, process the option, and then repeat until the user requests to end the program. The options you must accept and process are:

The details of each option are presented below. In this assignment you may use the do{} while(), while() {}, or for(;{} structures, but you may not use the goto or other unconditional repetition structures. Also, you may not use the math.h library or any other external math library to calculate your results - the goal of this assignment is to build your own code! Further, in this assignment you must accept input and display output as shown in the example below - you do not have the option of altering the input sequence or output sequence in this assignment.Code:* 'Q' or 'q': Quit the program * 'Eval(<exp>)': Evaluate a simple expression * '!n': Evaluate an integer factorial * 'P(n,k)': Count the number of permutations of length k in a string of length n.

The output below shows the input and output style that you should have in your program.

Sorry it's so long, but I feel like you should see all of it.Code:Enter one of the following options: Q - Quit the program Eval(<exp>) - Evaluate a simple expression ! - Evaluate an integer factorial P(n,k) - Count the k-permutations of a string of n characters Enter your option: P(3,2) A string of 3 characters has 6 permutations of length 2 Enter one of the following options: Q - Quit the program Eval(<exp>) - Evaluate a simple expression ! - Evaluate an integer factorial P(n,k) - Count the k-permutations of a string of n characters Enter your option: Eval(2 ^ 3) 2 ^ 3 = 8 Enter one of the following options: Q - Quit the program Eval(<exp>) - Evaluate a simple expression ! - Evaluate an integer factorial P(n,k) - Count the k-permutations of a string of n characters Enter your option: Eval(2 - 1023) 2 - 1023 = -1021 Enter one of the following options: Q - Quit the program Eval(<exp>) - Evaluate a simple expression ! - Evaluate an integer factorial P(n,k) - Count the k-permutations of a string of n characters Enter your option: Eval(3.4 % 5) 3.40 % 5.00 = 3.00 Enter one of the following options: Q - Quit the program Eval(<exp>) - Evaluate a simple expression ! - Evaluate an integer factorial P(n,k) - Count the k-permutations of a string of n characters Enter your option: !5 5! = 120 Enter one of the following options: Q - Quit the program Eval(<exp>) - Evaluate a simple expression ! - Evaluate an integer factorial P(n,k) - Count the k-permutations of a string of n characters Enter your option: !13 13! = 6227020800 Enter one of the following options: Q - Quit the program Eval(<exp>) - Evaluate a simple expression ! - Evaluate an integer factorial P(n,k) - Count the k-permutations of a string of n characters Enter your option: P(3,2) A string of 3 characters has 6 permutations of length 2 Enter one of the following options: Q - Quit the program Eval(<exp>) - Evaluate a simple expression ! - Evaluate an integer factorial P(n,k) - Count the k-permutations of a string of n characters Enter your option: P(4,2) A string of 4 characters has 24 permutations of length 2 Enter one of the following options: Q - Quit the program Eval(<exp>) - Evaluate a simple expression ! - Evaluate an integer factorial P(n,k) - Count the k-permutations of a string of n characters Enter your option: q