C++ Time Complexity Help

Time & Space In this assignment you need to analyze each of the following time & space asymptotic complexities and provide Big O and Big Omega for each. In addition, copy the code into a program and measure the amount of iterations each of the pieces of code makes with respect to n. Does it match your predicted time complexities? When done go ahead and turn all of the functions into the recursive equivalent. Did you get the same time complexities? Submit the program along with your complete charts for both 1. Resulting output for each piece of code for execution for n-10, 20, 30, 40, and 50 Code 1 Code 2 Code 3 Code 4 n 10 n-20 n-30 n 40 n50 2. Recursive Version: Code 1 Code 2 Code 3 Code 4 n 10 n-20 n 30 n 40 n50 Your program should prompt for a value for 'n' and executes the given codes then outputs counts for all 4 codes and then prompts for a new n. Keep prompting the user for n until he enters a value of 0 and then terminate the program Declare any variables and add any input/output code to make the code work. Here is sample output from your program (the numbers have been replaced with a question mark to avoid giving away the solution to the table. Sample Output: Enter a value for n (0 to stop): 10 Code 1: count = ? Code 2: count = ? Code 3: count-? Code 4 count-? Enter a value for n (0 to stop): 20 Code 1: count = ? Code 2: count-? Code 3: count-? Code 4: count = ? Enter a value for n (0 to stop): 30 Code 1: count = ? Code 2: count-? Code 3: count-? Code 4: count = ? Enter a value for n (0 to stop): 40 Code 1: count = ? Code 2: count-? Code 3: count-? Code 4: count = ? Enter a value for n (0 to stop) 50 Code 1: count-? Code 2: count = ? Code 3: count-? Code 4: count = ? Enter a value for n (0 to stop): 0 Code: #include /* Function for Code 3*,/ void fcn (int n, int *count) int i; for (i0 i<>