$2.$ Find the worst$-$case time complexity of the OpenMystery algorithm below. $\backslash$begin$\{$tabular$\}\{|$l$|$l$|\}\backslash$hline Input: n: positive integer $\backslash \backslash 1$ & Algorithm: OpenMystery $\backslash \backslash 2$ & Let open be a Boolean array of size n $\backslash \backslash 3$ & Initialize open to false $\backslash \backslash 4$ & nopen $=0\backslash \backslash 5$ & for i$=1$ to n do $\backslash \backslash 6$ & j$=$i $\backslash \backslash 7$ & while j$<=$n do $\backslash \backslash 8$ & if open $[$j$]$ then $\backslash \backslash 9$ & $$ nopen $=$ nopen $-1\backslash \backslash 10$ & else $\backslash \backslash 11$ & $$ nopen $=$ nopen $+1\backslash \backslash 12$ & end $\backslash \backslash 13$ & open $[$j$]=$ open $[$j$]\backslash \backslash 14$ & j$=$j$+$i $\backslash \backslash 15$ & end $\backslash \backslash 16$ & end $\backslash \backslash 17$ & return nopen $\backslash \backslash \backslash$hline $\backslash$end$\{$tabular$\}$