You are designing your own sorting algorithm using Divide and Conquer approach. The recurrence

relation for the time complexity turns out to be: T$($n$)=4$T $($n$/2)+(?).$ Which of the following is the

right choice for the time complexity of the combine step, such that T$($n$)=0($nlog$($n$)?$

$0($nlog$($n$))$

$$ None of the other given options are correct

$0($n$)$

$00($logn$)$

$0($n$)$