Use recursion trees to solve the following recurrences. You may assume that T$(1)=$ O$(1).$

T$($n$)=$ T$($n$/2)+$ n