Alogorithms and data structures JAVA

You have to compete 2 tasks out of 5 from one project and double check with the requirements if the previous 3 parts are correct. Its gonna be consider as a mini project. I am gonna provide the data structures which you have to use and the previous 3 parts. one of the files below contains full explanation for the 5 parts of the project so you can get the idea what its asked for. Follow the instructions in the file. Keep in mind that you have to complete part 4 and part 5 and correct the previous parts if you find any mistakes because you are gonna need them. Download the data structures from here.--------->>>>>>>>>>>>>>> [login to view URL] + attached the project files and explanation <<<<<<<<<<<<<------------------ EXTRA TIPS _______________________________ The route is a list of crossroad names. The destination is a crossroad name as well. Street names are not required. To run a simulation, you first create a simulation object and configure it (setting up the city, adding cars etc). You should have a method to start the simulation, it will start the loop you had now in your main file. The simulation stops if all cars have reached their destination, you could for example print something like “simulation done”. After running the simulation, you can call some methods to retrieve information on the result. For example: [login to view URL]() > 12.5 [login to view URL]() > 158 [login to view URL](“vehicleName”) > 10 [login to view URL](“vehicleName”) “A” -> “B” -> “C”