What is the time complexity of the following function fun$()?$

int fun$($int n$)$

$\{$

int count $=0$;

for $($int i $=0$; i $<$ n; i$++)$

for $($int j $=2$n; j $>0$; j$--)$

count $=$ count $+1$;

return count;

$\}$

Group of answer choices