A recursive algorithm has a time complexity of O$($n$!).$ For small inputs $($n $<5),$ this algorithm performs:

a$)$ Faster than O$($n$^2)$

b$)$ Faster than O$($n log n$)$

c$)$ Slower than O$($n$)$

d$)$ All of the above