Data Structures and Algorithms (complexity analysis)

- Please solve the questions and clearly show the final answer for each part.

- Also please write a brief explanation for the answers of question V only.

- Question VI only write the final answer (True or False).

Question V (10 points): 1. (4 points) Find functions f1 and f2 such that both f1(n) and f2(n) are (g(n)), but f1(n) is not (f2(n)). 2. (6 points) Determine whether the following statements are true or false. Briefly justify your answer. 1. If f(n) is (g(n)), then 2f(n) is (2g(n)). 2. f(n)+g(n) is (min(f(n),g(n)). 3. 2na is O(2n), where a is a constant. Question VI (15 points): Fill in the following blanks with either T for true or F for false