Question # 01: Compute big-oh of the given T(n) using the specified methods: Iteration Method: T(n) = 8T(n/2) + n 2 where T(1) = 1, n o =1 T(n) = 7T(n/2) + n 2 T(n) = 4T(n/2) + n 3 . Recursion Tree...

Question # 01:

Compute big-oh of the given T(n) using the specified methods:

Iteration Method:

1. T(n) = 8T(n/2) + n²where T(1) = 1, n_o=1


2. T(n) = 7T(n/2) + n² T(n) = 4T(n/2) + n³.

Recursion Tree Method:

1. T(n) = 3T(n/2) +n


2. T(n) = 2T(n-1) + 1

Master Method

1. T(n) = 2T(n/4) +1


2. T(n) = 2T(n/4) +n


3. T(n) = 2T(n/4) +√n


4. T(n) = 2T(n/4) +n²