There is a fenced area in the shape of a convex polygon with vertices at points p-1 (x-y-1), p-2 x_2y_2), .. p_n (x_ny_n) (not necessarily in this order) There are two more points, a (x_ay_a) and b (x_b.y_b) such thatx_a max(x_1,x_2... X_n). Design a reasonably efficient algorithm for computing the length of the shortest path between a and b