For the following operations, define the best$-$case runtime complexity in trms of n$.$

static int Sum$($int n$)$

$\{$

int sum $=0$;

if$($n$==0)$

$\{$

return;

$\}$

for$($int i$=0$; i