Find the worst-case time complexity of the MatrixMystery algorithm be- low Input: mat: n X n array of integers Input: n: number of rows and columns in mat 1 Algorithm: MatrixMystery 2 for 2 to n do for j 1 to i-1 do dot 0 for k - 1 to n do 4 5 6 7 8 9 10 dot dottmat kli] end if dot - 0 then return true end 11 end 12 end 13 return false