(a) Rank the following three functions: log N, log (N2), log2N. Explain.
The answer to the question is given below.
The solution is given in the image below.

If the answer helped please upvote it means a lot. For any query
please comment.
(a) Rank the following three functions: log N, log (N2), log2N. Explain.
Rank the following functions from slowest growing to fastest growing (i.e. fastest to slowest) 1 (constant) log2n (logarithmic) n (linear) n * log2 n (“n log n”) n2 (quadratic)
What is the average running time for quicksort? O(1) O(log10N) O(log2N) O(log2N) O(N) O(N log N) O(N2) O(N3) O(Nk) O(2N) O(N!)
Order the following functions by growth rate: N, squrerootN, N1.5, N2, NlogN, N log logN, Nlog2N, Nlog(N2), 2/N,2N, 2N/2, 37, N2 logN, N3. Indicate which functions grow at the same rate.
What is the worst case running time of a linear search? O(1) O(log10N) O(log2N) O(log2N) O(N) O(N log N) O(N2) O(N3) O(Nk) O(2N) O(N!)
What is the worst case running time of a binary search? O(1) O(log10N) O(log2N) O(log2N) O(N) O(N log N) O(N2) O(N3) O(Nk) O(2N) O(N!)
Order the following functions by asymptotic growth rate. 2n log n + 2n, 210, 2 log n, 3n + 100 log n, 4n, 2n, n2 + 10n, n3, n log n2
Which of the following functions has the highest order of growth? A. 2n+log(n) B. n+2*log(n) C. n+log(2n) D. n+log(n2) E. All of the above have the same order of growth.
Which of the following could be false? A. n2/(log(n)) = O(n2). B. (log n)1000 = O(n1//1000). C. 1/n = O(1/(log(n))). D. 2(log(n))^2 = O(n2). E. None of the above.
76. Arrange the following functions in ascending or- der of growth rate: 4000 log n, 2n2 + 13n - 8, 1,036, 3n log n, 2" - n2, 2n! - n, n2 – 4n.
***Please answer all the following (Computer science)
Discrete math question completely.***
Q2. Growth of functions. In each of the following cases, either construct a function /(/n) that satisfies the specified constraints or state that no such function exists. (2pt each) b, (n)-Ω(n2) and/(n)-O (n + n') In the following two questions, arrange the functions in a list so that each function is a big-O of the next function. (2pt each) d. nlog n, V', log n, (log2n+log n+n), 12 n,...