Please solve for PYTHON.

The Euclidean distance is a measure of the distance between two points in n-dimensional space. For two points: = (1, 2, , ) and = (1, 2, , ) the Euclidean distance, d, can obtained by applying the following formula: = ((1 1 )^ 2 + (2 2 )^ 2 + + ( )^ 2)

b) 14 marksl On this page and the next page, write a function that will take a nested list representing points in n-dimensional space and return the minimum and maximum Euclidean distance between all pairs of two different points. For example >>>points-[[1,2,3], [1,1,4], [1,-2,3, [1,0,1], [10,0,-111 >>> print (find minmax_distances (points)) (2.8284271247461903, 10.344080432788601) You should use the euclidean_distance from Question 3a) and you can assume that it works correctly (regardless of your answer for 3a). You may also assume that the argument to the function find minmax_distances will be a nested list representing at least three n-dimensional points def find minmax_distances (points): (list of lists) -> (num, num) Input: a nested list of floating point numbers representing at least three points in an n-dimensional space Output: a tuple (min, max) containing the minimum and the maximum Euclidean distance between all pairs of two different points Pre-conditions: all sub-lists have the same size and contain only floating point numbers