Algorithms Design and Analysis Activity 1 Q1) Consider the following algorithm that compute the distance (difference) between each two adjacent numbers in the array A which contains n numbers Algorithm MinDistance (A[0.1 1]) // Input: Array A[O..n 1] of numbers //Output: Minimum distance between two of its elements dmin - for i - 0 ton - 1 do for jo to n - 1 do if i + j and A[i] - A[j]|