show an algorithm to find the closest pair among points on a graph and return the Euclidian distance. IL F 10 5 E -5 0 5 C B A 10 15 D Write pseudocode for an algorithm to find the most distant pair of points on a graph and return the Euclidian distance. Pseudocode is acceptable, but the logic must be correct. You might therefore find it easier to work with the provided code to test your algorithm's correctness. (6 points)