Design a trip, starting in Peoria, that will visit Chicago, Champaign-Urbana, and Rockford. You will plan to stop at two historic sites along your route and you will end up in Effingham.i) Draw your graph, clearly showing your route and stops.ii) Find the path that will minimize your distance; use Djikstra’s Algorithm here. U.S. Grant Home, Wild Bill Hickok MemorialLincoln MemorialWashburne HouseOld Market HouseCampbell's Island Memorial.Black Hawk-Jubilee College-Apple River Fort-Lincoln TombBishop Hill.Carl Sandburg Home.OquawkaVietnam Veteransww II, & KoreanWar MemorialsOld State CapitolLincoln's New Salem,Albany Mounds-NauvooHamitoLincoln HerndonLaw OfficesDana Thomas QuincyHouseVachel Lindsay HomeLovejoy Monument.Gov. Coles MemorialLewis & ClarkEmerald Mound-Rock Island TCarthaBayerCahokia MoundsMarcelingSheringLibertyEkzahBrookdyBatchtowiBrustKanevilleMacombPatidGalenaSavanMonitoSt. AugustineGoodHoperFort Kaskaskia-JacksonvilleFutonGratonFort de Chartres.ListownBroWo ShCarbitonEldredGalesburgMartin Boismenue House-ES LOCahokaJarrot Mansion-Cahokla CourthouseBeardstowTrussonGenespoGrand Village of the IllinoisTcangPierre Menard HomeKaskaskia BelOtterleDuncanJenbyvilleStaringCartonendKewanesChathamGirardCarinvilleGodfeyAhanBeloveWaterlooMomiaTAHOOKTampico Mend(C) ORockordConsideonPeonialMorton8MetoMascotaRotiKaskaskia ChocabeGov. Bond MemorialLichfieldSpringfieldFundsGroveMayboroSate UticaTheylopeseNorwegian Settlers MemorialGPanaBaPrairie do RochkModoc tu OupinQuervilleLincoln CantonCOAtpPassBelvide Graphe.101@CharleDe Kals WhedonMc UnanChamahopDowody-CerrataCairoNOMETBloomingtonDwightVandaliaDecaturWindsorShelbyvilleAnrurLovington SullivarMatboPontacMorisHorrinCarbondale.MarionMt. VernonPalatingBentonMon MetropolisC400-FloraNapeMechaNepga anesvitKankakeeEftghamWinCTuscolaArcolaLockpogORantoulUrbaniaChampaignEldoradCharentFairfeldZionWaukegan@GolcondaCaptopMc LanstafoHighland ParkWinnetkaEvanstonBourbonsWestfieldPonsonBuel HouseChicagoWasekaPullman Hotel FlorenceHoopestonKincaid MoundsGov. HornerMemorialMetamora CourthouseDouglas TombDavid Davis MansionDanvilleHoffman Tower-Rose Hotel-Postville CourthouseMt. Pulaski Courthouse-Bryant CottageLincoln Log CabinLawrence Lincoln Trail MonumentOlneyMt. CarmelVandalia StatehouseHalfway TavernShawneetown Bank-Crenshaw / Old Slave House (3)Design a trip, starting and ending in Peoria, that will visit the cities of East St. Louis, Peru,Springfield, and Joliet; you will also plan to stop at two historic sites along the way.i) Draw your graph, clearly showing your route and stops.ii) Find the path that will minimize your time; assume 70 mph travel along each interstate edgeand 30 mph from interstate to the historic site; use the Nearest Neighbor Algorithm here.

Step-by-step process of Dijkstra's Algorithm. Mark all nodes unvisited. mark the start node with the current distance as 0. And, rest nodes with infinity. put the start node as the current node. For, the current node, analyze all unvisited nodes. Measure the distance by adding the current distance to the weight of the edge. Compare the recently measured distance with the current distance. make it a new current distance of the neighboring node. consider all unvisited nodes for the current node, and mark the current node as visited now. if reaches the destination, mark it visited. and, stops. If the destination is not reached, choose an unvisited node with a minimum distance. and, repeat the process again.To design a Trip, Consider a route starting in Peoria, that will visit Chicago, Champaign-Urbana, and Rockford. And, end up in Effingham. In the below graph: nodes represent different cities and connections between them represent distance. Though the weights are not provided clearly, we assume the weights. 1) Consider the graph below to represent the routes and distance between them. In the above graph, We have 5 nodes that represent cities. The edges consist of weights that represent the distance between two cities. Peo is starting node and Eff is the end node. 2) Now, we will find the shortest path from the start to the end node using Dijkstra's Algorithm. Consider the graph below:- The simple representation is shown below to find the shortest path:- current node=Peo Select the minimum distance from node Peo. That is 100. Now, cha is the current node. Check the neighbor of Cha. select the minimum distance from node cha. that is 200. Now the current node will change to Roc. Next, check neigbours of Roc. Select the minimum distance from node Roc. That is 500. the current node will now is chi. next, check chi neighbors. Select a minimum distance .that is 100. the current node will change to EFF which is the final destination. Hence, the path we choose having minimum distance is: Peo->cha->Roc->chi->Eff Final graph: