1. Find the complexity of the following set loops, where n is given as input:

2. Discuss the following hypothesis: You cannot find two functions f(n) and g(n) where f(n) O(g(n)) as upper bound & f(n) (g(n)) as lower bound

3. Find time complexity of the following recurrence T(n) = 3T(n/4) + n

4. Find time complexity of the following recurrence T(n) = 8T(n/6) + n

5. Find time complexity of the following recurrence T(n) = 3T(3/5*n)+ n