A pair of Rebel Scum X-Wing Fighter pilots were shot down by our elite Tie Fighter squadron and have landed at the position indicated on the map shown on Slide 3. Three Stormtrooper Teams are in the area and have been tasked to go and capture them. The Stormtroopers have been informed of the routes they should follow to reach the downed pilots. Stormtrooper Team 1 ST1 Location to Checkpoint C to Checkpoint D to Checkpoint F to Pilot Location R1 Stormtrooper Team 2 ST2 Location to Checkpoint B to Checkpoint E to Checkpoint G to Pilot Location R2 Stormtrooper Team 3 ST3 Location to Checkpoint A to Checkpoint D to Checkpoint F to Pilot Location R1 Each route consist of the starting point for the Stormtrooper Team (Stormtrooper Helmet icon) and a series of checkpoints (designated by letters). Stormtrooper Teams can move 1 kilometer every 20 minutes and Stormtroopers only travel directly (straight line) from point to point. The downed pilots cannot move. Lord Vader has tasked us to create a Java program that will produce a visual aid to help the Stormtroopers in determining the distance and time to reach the Rebel pilots. Our program should produce an output as shown on slide 6. Based on the map shown on Slide create a Java Program that displays the following: 2D Euclidean Distance and Time from each Stormtrooper Team (Stormtrooper helmet icon) to each Checkpoint (green square) and each downed Rebel pilot (Rebel helmet icon). 2D Euclidean Distance and Time from each Checkpoint to every other Checkpoint. 2D Euclidean Total Distance and Total Time for the route the Stormtrooper Teams will travel to capture the pilots. Distance is expressed in kilometers and time in minutes. All distance and time values must be calculated by your program (i.e., you cannot manually calculate any value and place that value in your program). The output of your program should be formatted and printed to the console exactly as shown on Slide 6. 6 5 3 2 0 0 ST1 13. ST3 1 ST2 2 A 3 B 4 Tatooine 1 Grid = 1 SQUARE KM 5 E 6 7 8 9 R2 10 R1 8 11 12 TEAM ST 1 ST 2 ST 3 CP A CP B CHECKPOINT CP C CP D CP E CP F CP G CP A 4.47 km 89 mins TEAM ST1 ST2 ST3 3.16 km 63 mins 2.83 km 57 mins. CP A 0.00 km e mins 2.24 km 45 mins. 4.47 km 89 mins 4.47 km 89 mins. 3.00 km 60 mins CP B 3.61 km 72 mins 2.24 km 45 mins 3.00 km 60 mins. 7.21 km 144 mins 5.00 km 100 mins. CP B 2.24 km 45 mins. 0.00 km 0 mins. 2.24 km 45 mins. 3.00 km 60 mins. 2.83 km. 57 mins 5.39 km. 108 mins 4.47 km 89 mins ROUTE C to D to F to R1 B to E to G to R2 A to D to F to R1 CP C 4.00 km 80 mins. 3.16 km 63 mins 4.47 km 89 mins. 2.24 km 45 mins 0.00 km e mins 2.83 km 57 mins 4.12 km 82 mins 4.00 km 80 mins. CP D 6.32 km 126 mins 5.10 km 102 mins. TOTAL DISTANCE 11.66 km 9.06 km 12.13 km 6.00 km 120 mins 2D EUCLIDEAN DISTANCE AND MOVEMENT TIME TO CP C 4.47 km CP D 4.47 km 89 mins 89 mins 5.00 km 100 mins. DIRECT 2D EUCLIDEAN DISTANCE AND TIME TO CP E 6.40 km 128 mins CP F 8.00 km 160 mins. 3.00 km 60 mins 2.83 km. 57 mins 0.00 km 0 mins. 2.24 km 45 mins. 2.83 km. 57 mins 5.00 km 100 mins. 2.24 km 45 mins. 5.39 km 108 mins TOTAL TIME 233 mins 181 mins 243 mins CP E 3.00 km 60 mins. 2.83 km 57 mins 4.12 km 82 mins. 2.24 km 45 mins. 0.00 km e mins 7.07 km 141 mins 8.25 km 165 mins. 2.00 km 40 mins 5.00 km 100 mins 5.39 km 108 mins 4.00 km 80 mins CP F 7.21 km 144 mins 2.83 km 57 mins CP G 8.06 km 161 mins. 0.00 km e mins 6.71 km 134 mins. 4.12 km 82 mins 7.28 km 146 mins. 5.00 km 100 mins. CP G 5.00 km 100 mins 4.47 km 89 mins 5.00 km. 100 mins 2.24 km 45 mins. 2.00 km 40 mins 4.12 km 82 mins 0.00 km 0 mins R1 10.00 km 200 mins 9.06 km 181 mins 10.20 km 204 mins R2 9.85 km 197 mins 8.54 km 171 mins 9.22 km 184 mins.