NEED PYTHON CODE ASAP

Can't read the text? Switch there 1. Minimum Euclidean Distance Pairs Given a list of N coordinates on the X-Y Cartesian plane, find the set of pair/s of coordinates with the minimum Euclidean distance between them. Euclidean distance can be calculated using the formula below: dist[(x1, y1). (x2, y2) = v(x2 - x12 + (y2 - y1) Constraints . You are not allowed to use any in-built functions for sorting (e.g. sorted). Ilst.sort() etc) . You are not allowed to use min(). max() functions on the list. You are not allowed to reverse the list using Ist(3-1) Euclidean distance should be rounded to 3 decimal places Input Format For Custom Testing A list containing N tuples representing the X-Y coordinates. Sample Case 0 Sample Input For Custom Testing [(0,0), (0,2), (1,1), (3,0), (3,2)] Sample Output [((, e), (1, 1)), ((0, 2), (1, 1))) Explanation The input is a list of tuples containing the X-Y coordinates. The output is a list containing tuples of the pair of X-Y coordinates with the minimum Euclidean distance. The tuples appear in order of their occurrence in the original list