For the given recurrence relationT$($n$)=$ aT$($n$-$b$)+$ f$($n$)$if a$<1$The worst case complexity isNot any of these Onk$)$ Where f$($n$)=$ O$($nk$)$ such that k $00($n$*$f$($n$))00($n$)$