Question IV $(20$ points$)$: Consider the following algorithm, where the input is two arrays of sizes $n$ and $m,$

respectively.

boolean arraysEqual$($int$[]$ array$1,$ int$[]$ array$2)\{$

int $n=$ array$1.$ length;

int $m=$ array$2.$length;

if $(n==m)$

return false;

for$($int $k=0$;$k$