I have some questions regarding solving this recurrence relation T(n)=2T(n/2) + 5 using master theorem.
$$T(n) = 2T(n/2) + 5$$
I managed to get a time complexity of Θ (n log n) as my answer using master theorem case 2 but I'm quite sure its incorrect, never come across a integer on its own = f(n) so far and am unsure how to handle it, would appreciate some clarification on this matter.