This is an optional challenge that may be used as a makeup Lab Activity. If you don't need to replace earlier work, then it may be used to boost a grade that is close to, but not quite crossing, a letter grade boundary. We have already created the Waypoint class and the Travelable interface. Simply make an application prompts the user for waypoints to plan a route and then saves the route as a sequence of records in solution should consist of four files: that . Travelable.java// the interface Waypoint.java // the class that extends Point2D.Double and implements Travelable . Route.java// the application that prompts for waypoints and creates the route Route.data // a text file storing the waypoints as records for an example route When the program starts, if Route.data exists, print out the route as a list of x and y coordinates along with the speed and street name AND the distance and time from the previous waypoint to the current one (for all but the first waypoint), then print out the average speed and overall time for the route. Finally, after listing the previously existing route as in the above, prompt the user to build a new route (which will overwrite the previous one If there is no existing Route.data file (as in a first time run), then simply build the route and store it in the data file. Remember, as you prompt the user for waypoints (see below for an example), you end the program (and the route) when the user enters a speed of zero for the current (last) waypoint. Way point 01: 1.0 1.0 40 Anaheinm Way point 02: 4.0 5.0 40 Fullerton Way point 03: 7.0 9.00 Brea Total distance to destination: 10.0 units Total time to the destination: Oh 15m Average speed over this route: 40.0 units/hour Then, the summery lines are printed (see above for an example). Black is program output, Red is user input Blue is calculated output in the above example. and This is an optional challenge that may be used as a makeup Lab Activity. If you don't need to replace earlier work, then it may be used to boost a grade that is close to, but not quite crossing, a letter grade boundary. We have already created the Waypoint class and the Travelable interface. Simply make an application prompts the user for waypoints to plan a route and then saves the route as a sequence of records in solution should consist of four files: that . Travelable.java// the interface Waypoint.java // the class that extends Point2D.Double and implements Travelable . Route.java// the application that prompts for waypoints and creates the route Route.data // a text file storing the waypoints as records for an example route When the program starts, if Route.data exists, print out the route as a list of x and y coordinates along with the speed and street name AND the distance and time from the previous waypoint to the current one (for all but the first waypoint), then print out the average speed and overall time for the route. Finally, after listing the previously existing route as in the above, prompt the user to build a new route (which will overwrite the previous one If there is no existing Route.data file (as in a first time run), then simply build the route and store it in the data file. Remember, as you prompt the user for waypoints (see below for an example), you end the program (and the route) when the user enters a speed of zero for the current (last) waypoint. Way point 01: 1.0 1.0 40 Anaheinm Way point 02: 4.0 5.0 40 Fullerton Way point 03: 7.0 9.00 Brea Total distance to destination: 10.0 units Total time to the destination: Oh 15m Average speed over this route: 40.0 units/hour Then, the summery lines are printed (see above for an example). Black is program output, Red is user input Blue is calculated output in the above example. and