f the algorithm doIt has an efficiency factor of 5n, calculate the run-timeefficiency of the following program segment:for (i = 1, i <= n; i++)doIt (...)

Calculate the run-time efficiency of the following program segment:for (i = 1; i <= n; i++)printf("%d ", i);

If the efficiency of the algorithm doIt can be expressed as O(n) = n2 , cal-culate the efficiency of the following program segment:for (i = 1; i <= n;; i++)for (j = 1; j < n, j++)doIt (...)

The time factor for determining the efficiency of algorithm is measured by counting the number of ____________Question 10Answera.Statementsb.Declarationc.Initializationd.Basic operation

Given that the efficiency of an algorithm is 5n2 , if a step in this algorithmtakes 1 nanosecond (10–9 seconds), how long does it take the algorithm toprocess an input of size 1000?

Algorithm Evaluate (A[0,...n-1])//Input: An array A[0,...n-1]) of real numbersminval  A[0]; maxval  A[0]for i 1 to n-1 doif A[i] < minvalminval A[i]if A[i] > minvalmaxnval A[i]return maxval - minvala. What does the algorithm compute?b. what is the basic operation?c. How many time is the basic operation executed?d. What is the efficiency class of the algorithm?e. Suggest an improvement or a better algorithm altogether and indicate its efficiency class.