Use selection via calculation(No if/while statements or logical operators) to create the C language program:

Given the data set size(n), the complexity category, and coefficient for two algorithms determine; (1) the run time for each algorithm, (2) identify the faster algorithm, and (3) the difference in time between the two selections. The picture shown below shows what the program should perform and what it should input from the user and output with two different examples. (Note: if both runtime are equal, the program should give out that algorithm two is faster):

Example Execution #1: Notes on Example Execution #1: Algorithm Complexity Options -=- . Both algorithms are from the same . The first algorithm has a smaller coefficient . The run time is a product of complexity complexity category (I) than the second. formula, the data set size, and the given 1. Linear time [n] 2. Logarithmic time [nlog (n) ] 3. Exponential time [n 2] Enter the size of the data set to sort-500 Select complexity option #1-> 1 Enter the coefficient of algorithm #1-> 10 Select complexity option #2-> 1 Enter the coefficient of algorithm #2-> 15 coefficient Time for algorithm #1 in seconds: 5000.000 Time for algorithm #2 in seconds: 7500.000 Faster algorithm #: 1 Time difference (seconds) 2500.000 Example Execution #2: Algorithm Complexity Options-= 1. Linear time [n] 2. Logarithmic time [nlog (n) ] 3. Exponential time [n 2] Enter the size of the data set to sort- 100 Select complexity option #1-> 1 Enter the coefficient of algorithm #1-> 125 Select complexity option #2-> 3 Enter the coefficient of algorithm #2-> 2 Time for algorithm #1 in seconds: 12500.000 Time for algorithm #2 in seconds: 20000.000 Faster algorithm #: Time difference (seconds): 7500.000