time complexity

Question

A) T(n) = 2T(root(n)) + 1  ; n>2

     T(n) =1   ; 0 < n <= 2

B) f(n) =n

g(n) = n(1+sin n)

where n is positive integer

which is true?

1.f(n) = O(g(n))

2.f(n) = $\Omega$(g(n))

Comments

@arjun sir : I am really sorry  to comment about other question here , but this https://gateoverflow.in/105762/testbook

question needs clarfication as answer suggested is $50-50$ .Confused what will be correct.

sir please see my comment there.I will make sure that i will delete my comment here afterwards :)

---

@sourav thanku :)

---

@arjun sir...okay :)

Answer 1

second one we cannot compare the both bcz at one point f(n) will be greater and at some point of time g(n) will be greater..

Hint: take sign values(0 to 90 enough) and check the both

Answer 2

Answer of 1st que is O(n)

Comments

@deepak by converting to a form and applying masters theorem we get  O(n) but in that case the condition that it works only for n>2 isnt considered right?