MCQ of time complexity part

#1

Q­13 Suppose T(n) = 2T(n/2) + n, T[0]=T[1]=1. Which of the following is true
A) T(n)=O(n^2)
B) T(n)=ø(nlogn)
C) T(n)=Ω(n^2)
D) T(n)=O(nlogn)

one more
Q­8 You have to find square root of a number(Only the integral part). In
what best time complexity we can achieve this?
A) n
B) √n
C) logn
D)1

#2

For Q13 answer would be D.
You can continue making series and then verify the answer easily.

#3

For Q8, the answer would be C) log(n)

As we can find the answer using binary search.