Write a function in c++ that follows the code format in the editor to the right. Please follow all the constraints and directions.

#include Cirdes Country is a country that contains several dircular- shaped districts. Some districts may be situated inside other districts, but their borders do not intersect or touch. Qatam is a resident of Cirdes Country, When he travels between two locations, he always tries to cross the fewest number of district borders as possible because crossing borders is usually a laborious task. int least-borders(vector &x, vector x and vectorcint> y and vectorcint: r, where (x1],yt1]) are the coordinates of the th district's center and ri] is its radius. There are n x.s1ze) circles altogether. You are additionally given coordinates point (a,y) and he needs to get to point (x2,y2) Neither of these points lies on a district border. Return the minimal number of district borders he must cross to get to his destination. xi,yi,x2, and ya. Qatam is currently at Constraints . n will be between 1 and 50, inclusive. .x,y and r will each contain n elements. .Each element of xand y will be between -1000 and 1000, inclusive. .Each element of r will be between 1 and 1000, inclusive. X1, y1, and yz will be between -1000 and 1000, indlusive. .No two circumferences will have common points. The points (x1,y) and (x2,y2) will not lie on any of the circumferences Examples 1. Input: [e] [81.(21, 5,1,5, eturns: 2. Input: 1-6,6 Le,1,2,(2,2,2-5,1,5,1 turns:2 3. Input: [1,-3,2,5, 4.12,12,11,-1,2,5,5,1,11.[8,1 turns