Problem: The runtime T(n) to connect a group of students who are playing so-called "copy & past" game is given as
T(n)=3*T(n/2)+log(n)
Required:
Question: What is the solution if the recurrence can be solved with the master theorem. Please explain your answer and also provide examples