Please solve using complexity analysis in computer science.

By choosing appropriate values for cand no, show that f(n) ia O{n). An) = 412 + 3 log n +10 Q.2: Consider the following functions in terms of n lg n is logan): (3/2", lg 2 n, n!, n lg n, 1. (a) Find the complexity class of each of these functions. (b) Order these functions from the most efficient to the least efficient in terms of their complexity classes. You may fill in the following table: + Function O(Complexity) Order Most Efficient (Tastest) Least Efficient (Sloweat) The following complexity analysis questions are from the textbook. For the each of the following code fragmenta, find the (a) Exact number of operations for the code (statements) in rectangles (b) The big-O complexity in terms of the code (statements) in rectangles Show all your work. Question 3 (a) Determine the complexity of the following implementations of the algorithms for adding, multiplying, and transposing ex matrices for (i = 0; i