4 THElongestHop PROBLEM Using the Star structure defined in file p1.cpp, write the function named longestHop(). The function takes one input parameter: a vector of Stars that represents a "travel itinerary". Visit every pair of stars in-order (0-1, 1-2, 2-3, etc.) and measure the distance between them. The function should return a vector of Star containing the two stars that are represent the longest hop" or span between two stars in the trip. We'll assume that the stars are in 2D space and that you measure the distance using this formula. /(x,-M)24(y2- You may write a function to do so. vectorestar longest IongestHop(vStars); 4 THElongestHop PROBLEM Using the Star structure defined in file p1.cpp, write the function named longestHop(). The function takes one input parameter: a vector of Stars that represents a "travel itinerary". Visit every pair of stars in-order (0-1, 1-2, 2-3, etc.) and measure the distance between them. The function should return a vector of Star containing the two stars that are represent the longest hop" or span between two stars in the trip. We'll assume that the stars are in 2D space and that you measure the distance using this formula. /(x,-M)24(y2- You may write a function to do so. vectorestar longest IongestHop(vStars)