What is the time complexity of the below algorithm:

def myFunction$($n$)$:

out $=0$ while n $>0$ out out $+$ n$\%10$ n $=$ n $/10$ return out

O a$.$ O$($n$)$

Ob$.$ None of the Other Options

Oc$.$ O$($n$^*$ log$($n$))[$base $10]$

Od$.$ O$($n $^(1/10))$

Oe$.$ O$($log$($n$))[$base $10]$