You are assigned to assist the captain of a spaceship who collects items/products from a number of planets in the Beta Quadrant. The routes that is followed by the spaceship is represented by the following map': o The data of the planets can be generated using a given C++ program. You will enter 3 student IDs (group members) and the program will generate a list of planets with the set of values for coordinates (x, y, x), item weight and item profit (for the item to be collected from each planet). o The home planet is Planet A, and you will analyse the data to produce the following: o List of sorted edges according to distance o List of sorted planets according to value The shortest path to each planet o The minimum spanning tree connecting all the planets The optimal set of planets to visit before returning home o Use the following formula to calculate the distance between planets: distance ij (x; x;)2 + (y; - y)2 + (2; zi)2 You are assigned to assist the captain of a spaceship who collects items/products from a number of planets in the Beta Quadrant. The routes that is followed by the spaceship is represented by the following map': o The data of the planets can be generated using a given C++ program. You will enter 3 student IDs (group members) and the program will generate a list of planets with the set of values for coordinates (x, y, x), item weight and item profit (for the item to be collected from each planet). o The home planet is Planet A, and you will analyse the data to produce the following: o List of sorted edges according to distance o List of sorted planets according to value The shortest path to each planet o The minimum spanning tree connecting all the planets The optimal set of planets to visit before returning home o Use the following formula to calculate the distance between planets: distance ij (x; x;)2 + (y; - y)2 + (2; zi)2