T$($n$,$q$)<=$ T$($k$,$q$/2)+$ T$($n$-$k$,$q$/2)+$ O$($n$).$ Can you mathematically unroll this recurrence relation using summations so that the final runtime is O$($n$)+$ O$($nlogq$)?$