Please explain your steps and how you got your answer

Find the worst-case time complexity of the OpenMystery algorithm below

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 for i - 1 to n do 6 while j n do if open[j] then 8 9 10 nopen nopen1 else nopen = nopen + 1 end 12 13 14 15 end 16 end 17 return nopen