What does the following algorithm compute? procedure who knows(a, az, . ..., a,,: integers) m:= 0 for i:=1 to n-1 for j := i + 1 to n if |a-a|>m then m:= = |a -al Find how many comparisons (if statement) are executed for n=2, n=4. Can you generalize to n.