1. Identify the worst-case time complexity for the algorithm below and prove your answer is correct. Please strongly justify your answer. You may make use of the identities below, which hold for any positive integer n:

i 2 e(1) Input: data: array of integers. Input n: length of data 1 Algorithm Loop Mystery 2 count Array(n) 3 for i 1 to n do count i i 5 end. 7 repeat 8 while is n and count 1 do count il -i 1 10 11 end 12 if i n then 13 Swap data [1] and data il 14 count il countlil 1 15 16 end 17 until i> n 18 return data