Consider the following algorithm: Problem: ? Input: Array A[O..n - 1] of integers Output: An integer m int Mystery (int[] A) int m = 0 for i = 0 to n-1 do for j = 0 to n-1 do d = 1 A[i] - A[j] || if i # j and d > m m = d. return m a. What does this algorithm do? b. What is its time complexity? c. Improve this algorithm. Feel free to change anything or even create a completely new algorithm that does the same thing