Answer the following for both of the above algorithms;

1)Proof of Partial correctness (Include a mathematical proof using assertions as well)

2)Proof of Total correctness

Minimum Distance Algorithms Levitin presents the following algorithm for finding the distance between the two closest elements in an anray of numbers [Ex. 1.209), p. 18. Algorithm MinDistance (A0.. 1]) //Input: Array A[o..n of numbers //Output: Minimum ditance between two of its elements d772272 ? OO for z ? 0 to n _ 1 do for j0 to n 1 do if i?J and Ai-Abil