procedure divide$($n: positive integer$)$

while n $>0$

m :$=(2$n $+5)/4$

n :$=$ n $1$

return m

What is the best$-$case scenario time complexity of this algorithm?

Group of answer choices

$\backslash$Omega $($n$)$

$\backslash$Omega $($n$2)$

$\backslash$Omega $(1)$

$\backslash$Omega $($logn$)$