and find the worse-time complexity for this as well as its a part of the q

3. Find the worst-case time complexity of the MatrixMystery algorithm be- low Input: mat: n n arrav of integers Input: n: number of rows and columns in mat 1 Algorithm: MatrixMystery 2 for i - 2 to n do 3Ior 4 5 6 7 8 9 3for j 1 toi 1 do for k = 1 to n do 1 dot = 0 dot = dot + mat [k] [i] . mat [k]Lil end if dot - 0 thern return true 10 11 end 12 end 13 return false en Input: n: positive integer 1 Algorithm: OpenMystery 2 Let open be a Boolean array of size n 3 Initialize open to false 4 nopen -0 5 for1 to n do 6 while j n do if openlj] then 8 9 10 nopen-nopen- else nopennopen +1 end 12 13 14 open open end 16 end 17 return nopen