$[5$ pts$]$ Use mathematical induction to show, that for all $n1$ :

$1+2+3+$cdots$+n-\frac{n(n+1)}{2}$

$[5$ pts$]$ Give the Big O $($complexity order$)$ of the following code segment

int sum $=0$;

for$($int i $=$ ; i