Waiting for answer This question has not been answered yet. You can hire a professional tutor to get the answer.

# Can you solve this reccurence relation problem? I need a solution that is solved by backward substitution or master's theorem and generalized T(n) formula T(n) = T(n/2)*n, T(1) = 1

Can you solve this reccurence relation problem?

I need a solution that is solved by backward substitution or master's theorem and generalized T(n) formula

T(n) = T(n/2)*n, T(1) = 1