Please note that I am not asking you to write the code but rather help with finding the 5 answers to input size, basic operation, worst case , and etc.. thank you!

Please help with my homework. Algorithm analysis. I need to answer the five questions such as input size, basic operations, worst case and etc.. I am a little bit stuck on finding the worst-case; so please add some explanation for reference thank you!! 5. Consider the following algorithm for finding the distance between the two closest elements in an array of numbers. Algorithm Min Distance (A[0..n-1]) //Input: Array A[0...n - 1] of numbers //Output: Minimum distance between two of its elements dmin - 00 for i-o to n-1 do for j - 0 ton - 1 do if i + j and A[i] - [j]I