Challenge task You are going to deliver a package to three different locations (0,10.co). din.ct) and (d2,12,c2), you are not on any of these locations and you have to decide where to start you are going to move based on the nearest then farthest locations you have to calculate the nearet two points you are going to start with. Write a program to find the shortest distance between these points Note ti you have to use the predefined pow function Note: you have to use predefined in and sqrt functions Note: the distance between two points (a, b,c) and (def) is calculated using the equations Vie - 23+ (6 - )*+1) Constraints O Path2 Code main.cpp 1 includeciostream> 2 using namespace std; 2 int main() {