Provide a minimal upper bound using Big$-$O notation for the following recurrence relation.

T$($n$)=0$ if n$=0$

$2$T$($n$/2)+$n if n$0$

$0$n$)$

$0($n$3$logn$)$

$0($nlgn$)$

$0($n$2$lgn$)$

$0($n$2)$

$0($n$2)$

O$($n$3)$