Select the asymptotic worst-case time complexity of the following algorithm: Algorithm Input: a1, a2, ..., an, a sequence of numbers n, the length of the sequence x, a number Output: ?? For i = 1 to...

Select the asymptotic worst-case time complexity of the following algorithm:
Algorithm
Input: a1, a2, ..., an, a sequence of numbers
n, the length of the sequence
x, a number
Output: ??
For i = 1 to n-1
For j = i+1 to n
For k = 1 to n
If ((ai)^2 + (aj)^2 = (ak)^2) Return( "True" )
End-for
End-for
End-for
Return( "False" )
a. ?(1)
b. ?(?)
c. ?(?2)
d. ?(?3)