Challenge task Three runners are running towards the end point, you are given the location of the end point at (e0,vo,to). You are asked to write a program to find the nearest runner to the end point if you are given the locations (e1,v1,11) for the first runner and (e2,v2,t2) for the second runner. Note 1: you have to use the predefined pow function Note2: you have to use predefined min and sqrt functions Note3: the distance between two points (a, b,c) and (def) is calculated using the equation: (a - d)2 + (6 c)2 + (0-1) Constraints 0 Path2 Code main.cpp 1 sincludeciostream> 2 using namespace std; 3 int main() { Type here to search of