Write the following C++ Code, Please focus on the following output provided:

Challenge task Three cars are moving on Three roads connected with intersection, the cars positions has the coordinates (cO,r0,po), (1,1,1) and (C2,r2,p2). You are asked to write a program to find the farest two cars location. Note 1: you have to use the predefined pow function Note2: you have to use predefined max and sort functions Note3: the distance between two cars (a, b,c) and (d,e,f) is calculated using the equation: v(ad) +(6-e) +(c-f)2 Constraints 0