All questions in below.

CS 6212 Farhady January 29, 2019 Assignment 1 Due Date: February 5th, 2019 Problem 1 (10 points) True/False 1. 3" E O(2) 2. 2n E o(n) 3. n+log n E (log n 4. 2nEo(5") 5. log(n!) E e(n log n) Problem 2 (60 points) Analyze the time complexity of the followings: int j 5; while(j 0; i/-2 forlint i 1 to n)l for(int j = 0; j