$3.$ Solve the recursion

T$($n$)=$T$($n$/2)+1\mathrm{.}5\%$

$4.$ Why any sorting algorithm using comparison as operator to sort needs

$(\backslash$Omega $($nlogn$)$

time.

$8\%$