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

"Get 15% discount on your first 3 orders with us"
Use the following coupon
"FIRST15"

Order Now
/by