PLEASE USE PYTHON

(a) [40 points] Construct an algorithm for finding the m(n2) closest pairs of points in P. Your algorithm inputs are P and m. Return the distances between the m closest pairs of points, including their x and y coordinates. i. [25 points] Define your algorithm using pseudocode. ii. [15 points] Determine the worst-case running time (page 25) of your algorithm (call this the algorithm's worst-case running time). (b) [20 points] Implement your algorithm. Your code must have a reasonable, consistent, style and documentation. It must have appropriate data structures, modularity, and error checking. (Your submission must include a readme text file which gives clear directions on how to run your program. Please refer to Programming Assignment Guidelines and Pseudocode Restrictions for more details.) (c) [10 points] Perform and submit trace runs demonstrating the proper functioning of your code. (d) [10 points] Perform tests to measure the asymptotic behavior of your program (call this the code's worstcase running time). This should include a table or figure which clearly shows the asymptotic behavior of your program. (e) [10 points] Analysis comparing your algorithm's worst-case running time to your code's worst-case running time