Consider a function sleep$($t$)$ that makes a computer processor sleep for a t miliseconds. Consider the function: function f$($n$)\{$ sleep$($log$($n$)/$n$)\}$ Clearly, as n increases, the time length of execution of f decreases. Which of the following is correct $($you may take for granted that lon$($n$)/$n converges to zero when n grows$)$: Question $2$Answer a$.$ Runtime of f is in Theta$(1/$n$)$ b$.$ Runtime of f is in Theta$(0)$ c$.$ Runtime of f is in Theta$(1)$ d$.$ It is impossible to define a Theta bound for this function, because the complexity of sleep function depends on its hardware implementation.