What is the tight bound using Big-Theta notation for the time complexity of the following recurrence relation: T(n) = 3T(n/2) + 1 when the Master Theorem is used? Θ(n^(log2(3))) Θ(n^(log3(2))) Θ(nlogn) Θ(log2(n))+O(1)

Consider the following recurrence relation: T(n)=3T(n/3)+n2/3,T(1)=1,T(0)=0 What is the complexity of T(n)? Options : Θ(n) Θ(nlogn) Θ(n^2/3) Θ(n^1.5)

Consider this recurrence relation: T(1) = 1 T(2) = 1 T(n) = 4 T(n-2) + 2n2 for n>2 The Master Theorem tells us T（n）∈Θ(n^3) T（n）∈Θ((n^2)logn) T（n）∈Θ(n^2) T（n）∈Θ(nlogn) nothing

Consider this recurrence relation: T(1) = 1 T(n) = 2 T(n/3) + 2n + 1 for n>1 The Master Theorem says that T（n）∈ Θ（）

Consider the following recurrence relation for a function T(n):T(n) = 3T(n/2​) + nUse the recursion tree method to determine the time complexity of T(n)

Find the time complexity for the following function (the basic operation is the innermost loop body's assignment). function f(n) r ← 0 m ← 1 for i ← 1 to n do m ← 3 × m for j ← 1 to m do r ← r + j return r GROUP OF ANSWER(CHOOSE ONE CORRECT): Θ（n） Θ（n^3） Θ（3^n） Θ（nlogn） Θ（n^2）