WRITE ME CODE IN C++

O Challenge task You are to write a program to find the minimum distance between two different points on the 3D-Cartesian plane (w Bus Sgnal) and a given (reference) point. i.e. we have three points, one reference points (j) (x0,y0,20) and two other points (x1, y1,z1) and (x2,y2,22). 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 (d,e,f) is calculated using the equation: V(a d)2+(6-2)2+(c-f)2 w Constraints 11: 0 Output Format The minimum distance between the reference point and the other points. (use float or double data type for the result without approximation) Sample #1 Input 123 4 5 6 7 8 9 Output 7.07107 Sample #2 Input 10 11 12 15 18 19 20 22 30 Output 13.7477