1. Consider the following scenario:
The Colonel Motors Corporation of Frankfort, Kentucky hasproduced a new line of vehicles which require chicken droppings forfuel. Because of this unusual fuel requirement, there are onlycertain fueling stations in the country where the vehicles can berefilled. Thus, to get from one place to another, an owner mustplan a route that ensures that he can get refills along the way.The Colonel Motors Corporation has hired Professor Sanders of theKentucky Institute of Technology as a consultant to prepare anonline route-finding service. To use the computerized service, anowner will enter the driving range of his vehicle (the distance thevehicle can go on a single fill-up), the \"distance to empty\" (thedistance the vehicle can go with the fuel that's now in the tank),his/her initial location (source), and his/her desired destination.The service will either respond with a shortest route from thesource to the destination such that the owner never runs out offuel, or it will deem that no such route exists. Model theprofessor's problem in terms of a weighted, directed graph in whichstreets are edges, intersections are vertices, and someintersections have fueling stations, and design an efficientalgorithm to solve it. Assume that a driver's source anddestination are also at intersections.
2. Choose an appropriate problem solving technique:
a. Select your favorite programming language such as C, C++, orJava. In that language, write, implement, and test an algorithmusing the problem solving technique that you chose.
b. Analyze your implementation using either order notationanalysis or empirical analysis.
c. You must prepare a separate page providing the instructionsto compile and execute your program, such as the developmentenvironment (e.g., Visual Studio). If no such information isprovided, and your program fails to build and run, points will bededucted, as appropriate.
TASK:
1. Java code
2. Discussion of your problem solving technique and whychosen
3. Algorithm (pseudocode, source, etc.)
4. Correctness
