int sum,i;

sum $=0$;

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

sum$++$; Assume that basic operations and input output take single time units to complete. Calculate the time

complexity function T$($n$)$ and O$($n$)$ for the following program fragments: