What does the following pseudocode? What is its complexity? (10 Points) 7 procedure mystery(a1,...,an: integers) abc = ai def: = 42 if a >athen begin def := a1 abc : = 42 end for i:= 3 ton if a > abc then begin def: = abc abc : = end if (a; > def and a; sabc) then def. = a. return def It finds and returns the location of the largest integer in a list. It's complexity is O(n^2). 3 It finds and returns the second-largest integer in a list. It's complexity is O(n^2). It finds and returns the average of the largest and second-largest integers in a list. It's complexity is O(n^2). D It finds and returns the second-largest integer in a list. It's complexity is O(n). It finds and returns the average of the largest and second-largest integers in a list. It's complexity is O(n). T It finds and returns the location of the largest integer in a list. It's complexity is O(n)