Give a big$-$Oh characterization, in terms of n$,$ of the running time of the example$5$ method from Exercises.java class in Lesson$4$Examples folder.

For each of the above questions, use comments in the code to provide the results and a brief explanation.

Here is the original code:

public static int example$5($int$[]$ first, int$[]$ second$)\{//$ assume equal$-$length arrays

int n $=$ first.length, count $=0$;

for $($int i$=0$; i $<$ n; i$++)\{//$ loop from $0$ to n$-1$

int total $=0$;

for $($int j$=0$; j $<$ n; j$++)//$ loop from $0$ to n$-1$

for $($int k$=0$; k $<=$ j; k$++)//$ loop from $0$ to j

total $+=$ first$[$k$]$;

if $($second$[$i$]==$ total$)$ count$++$;

$\}$

return count;

$\}$

$\}$