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 Aon-11) Input Array 40.1 - 1 of numbers Output Minimum distance between two of its elemente dmin - for 10 ton-1 do for-Oton I do if + and All - All 3 for (k = 0; kc k++) sequence of statements 1 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 Aon-11) Input Array 40.1 - 1 of numbers Output Minimum distance between two of its elemente dmin - for 10 ton-1 do for-Oton I do if + and All - All 3 for (k = 0; kc k++) sequence of statements 1