If a divide$-$and$-$conquer algorithm running time function has the recurrence, for n$>1,$ T$($n$)=4$T$($n$/2)+$f$($n$),$ then the number of subproblems to be solved to solve the original problem is