Part II: Big$-$oh Notation Calculation

Algorithms. java File

Provide the $O(n)$ for each of the following code segments

public class Algorithms

public static int $m1($int $n$

int sum $=0$;

for $($int $i=0$;$,in$;$,i++$

$\}$

sum $+=i$

return sum;

$\}$

public static int int $n$

int sum $=0$

for $($int $i=0$;$in$;$i+t$

for $($int $j=0$;$jn$;$j++$

$\}$

${\displaystyle \underset{?}{\overset{?}{}}}+=i+j$

$\}$

return sum;

$\}$

public static int $m3($int $[]$ a$,$ int key$)\{$

int $10=0$;

int hi $=$ a$.$ length $-1$ ;

while $)(hi\{$

$//$ Key is in a$[$lo$..$hi$]$ or not present.

int mid$=10+\frac{hi-10}{2}$;

if key