3. 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 i- 2 to n do 3 | for j-1 to i-1 do dot 0 for k 1 to n do 4 5 6 7 8 9 10 dotdot mtkmat klLi] end if dot- 0 then return true end 11end 12 end 13 return false