MadeEasy Test Series 2018: Algorithms - Reccurence

Question

Kindly help in solving the following recurrence relation. Solution is given by using Master's Theorem but can it be applied when the parameter 'b' is not an integer?

IF not, then how to solve it?

options are O(n), O(n^2), O(nlogn), O(n^2 logn)

Comments

answer will be O$(n^2)$

by using masters theorem we can apply masters theorem

---

$n^{log_{\sqrt{2}}2}$ = $\Theta (n^{2})$

---

Master's theorem can be applied here to get the answer $\Theta (n^{2})$ by the formula pointed out by @Mk Utkarsh.

Answer 1

 master theorem is not applicable. here a is not  a => 1.