Question $2$

$($a$)$ What is the tightest bound big$-$Oh $($O$)$ time complexity for the following code in terms of input

size $n?$ Show all necessary steps:

Algorithm MyAlgorithm $($A$,$ B$)$

Input: Arrays A and B each storing $n1$ integers.

Output: What is the output? $($Refer to part b below$)$

Start:

count $=0$

for $i=1$ to $n**n$ do $\{$

sum $=0$

for $j=1$ to $i$ do $\{$

sum $=$ sum $+A[0]$

for $k=1$ to $j$ do

if $(kn-1)$

sum $=$ sum $+A[k]$

$\}$

if $B[i-1]=(i$

$ifB[i-1]$ sum then count $=$ count $+1$

$\}$

return count

$(b)$ Document a hand$-$run $on$ MyAlgorithm for input arrays below and show the final output.

Thank you!