40 Challenge task Three runners are running towards the end point you are given the location of the end point at (e0, v0,10). You are asked to write a program to find the nearest runner to the end point if you are given the locations (e1,41,41) for the first runner and (02.12.12) for the second runner. Note : you have to use the predefined pow function Note2: you have to use predefined min and sort functions Note3: the distance between two points (a, b,c) and (def) is calculated using the equation - dj + (0 - 2}+{c-f Constraints 0 Output Format The nearest runner to the end point. (use float or double data type for the result without approximation) Sample #1 Input 146 58 9 632 Output 8.30662 Sample #2 Input 5 8 9 10 5 7 15 32 25 Output 23.5584