The recurrence equation for the merge sort algorithm is:Question $5$Answera.T$($n$)=$ nlognb$.$T$($n$)=$ T$($n$/2)+$ T$($n$/2)+$ lognc$.$T$($n$)=$ T$($n$/2)+$ nlognd$.$T$($n$)=2$T$($n$/2)+1$e$.$T$($n$)=2$T$($n$/2)+$ nlognf$.$None of the answers