Please help me

The extended Euclid's algorithm determines not only the greatest common divisor d of two positive integers m and n but also integers (not necessarily positive x and y, such that mx + ny = d. Look up a description of the extended Euclid' s algorithm (see, e. g. [Knul], p. 13) and implement it in the language of your choice Modify your program for finding integer solutions to the Diophantine equation ax + by = c with any set of integer coefficients a, b, and Consider the following algorithm for finding the distance between the two closest elements in an array of numbers.//Input: Array A[0... n - 1] of numbers//output: Minimum distance between two of its elements d min rightarrow infinity for i leftarrow 0 to n - 1 do for j leftarrow 0 to n - 1 do if i _ = j and |A[i] - A[j]