Generally a recurrence relation is given as
T(n)=aT(n/b)+ f(n)
where a is no of sub prblm of size n/b each.
Can there be any real scenario where a>b.
I mean if n is divided into n/b problems then there must be at most b problems...So that b*n/b=n.....then how can a>b??