T$($n$)=\{1,$ for n $<=1,3$T$($n$/2)+$n$,$ for n $>=2$ how many subproblems does the algortithm divide theoriginal problem into, and what is the size of each subproblem?