please solve as soon as possible

PROBLEM SCENARIO CO2 On holday, a fight oumently warts to travel io Bucharest trom Arad. bur then is: no divect way to Buchasest frem Arad. Howevet, the eleet are corinected with fuch other like a graph. The dishence betwetr the aonhected cties are given. The fight wants to traved through the most optimal aay. To lind the ogfimal pain to travel. arether informaton is provided; the atraight line distance betheseb any cily who the final destinasion (Bvetharest Now apply A* search so delerminat The mest eatimal value iof the route Arad as Bucharest and hele the flight. Yev hove ko use the saraighe lene disdance as ite heuristic value for the clbes For simplicity assume these notations INPUTS Your tot fie should take each node followed by ewch destination it can mash and their corresponding destance and heurisfics. Yoe are to read the tile then aak the user ts inpse the starting and the destinatign point. OUTPUTS The eutput will eortain the sotal distarce from the staring point to the destrafich followod by printing the nodes it followed io caledale the distaree. SAMPLE INPUT In the lest lie: Arad 36e Zerind 75 shey 100 Timisoarn 118 Zerind 374 Ased 75 Oradea 71 Oradea 390 Zerind 71 Sbu 151 Buchayst 0 Pitesi tot Fagaras 21t Gumpie eo Urdoen as Qurger Y7 Buct aves go The test fle is arranged as tollows: Each line starts wit a node folowed by the heuristic of that node Then the neightering nodet ared the detarce tom twe parent node it ghten as aper NS neiditoring oify dstance pais are lased aher the heuristc. SAMPLE INPUT in the toat fiec Arad 366 zerind 75 Mbcu 145 Timigowy 11s Berind a74 Aead 75 Craclea 71 Oradea 380 Zerind 71 shiu 151 Buchaves 0 Pvesti 191 Fagaras 21t Guagu 90 Urzicen 85 Cingly T? buchavent 90 The teet file is arranged as follows: Each lane starts with a node followed by the heurafe of that node Then the neichtoring nodes arit the divetunce trom the barert node is phen as an par All neightoring cily-distarce pairs are lised a har the heutible. node to Zetind. Sbu ard Trmisaxin which are 75 , 149 and 15km andy from Anat Notce that since Bucharest is the End nose which is why it hat a heuctic of o In console: Start node: Arad Destination: Bucharest Sample output Path: Arad os Sblu . Firrinicu or Phesf or Bucharest Total distance: 418km PATH FCENG' PROBLEM SCENARIO CO2 On holday, a fight oumently warts to travel io Bucharest trom Arad. bur then is: no divect way to Buchasest frem Arad. Howevet, the eleet are corinected with fuch other like a graph. The dishence betwetr the aonhected cties are given. The fight wants to traved through the most optimal aay. To lind the ogfimal pain to travel. arether informaton is provided; the atraight line distance betheseb any cily who the final destinasion (Bvetharest Now apply A* search so delerminat The mest eatimal value iof the route Arad as Bucharest and hele the flight. Yev hove ko use the saraighe lene disdance as ite heuristic value for the clbes For simplicity assume these notations INPUTS Your tot fie should take each node followed by ewch destination it can mash and their corresponding destance and heurisfics. Yoe are to read the tile then aak the user ts inpse the starting and the destinatign point. OUTPUTS The eutput will eortain the sotal distarce from the staring point to the destrafich followod by printing the nodes it followed io caledale the distaree. SAMPLE INPUT In the lest lie: Arad 36e Zerind 75 shey 100 Timisoarn 118 Zerind 374 Ased 75 Oradea 71 Oradea 390 Zerind 71 Sbu 151 Buchayst 0 Pitesi tot Fagaras 21t Gumpie eo Urdoen as Qurger Y7 Buct aves go The test fle is arranged as tollows: Each line starts wit a node folowed by the heuristic of that node Then the neightering nodet ared the detarce tom twe parent node it ghten as aper NS neiditoring oify dstance pais are lased aher the heuristc. SAMPLE INPUT in the toat fiec Arad 366 zerind 75 Mbcu 145 Timigowy 11s Berind a74 Aead 75 Craclea 71 Oradea 380 Zerind 71 shiu 151 Buchaves 0 Pvesti 191 Fagaras 21t Guagu 90 Urzicen 85 Cingly T? buchavent 90 The teet file is arranged as follows: Each lane starts with a node followed by the heurafe of that node Then the neichtoring nodes arit the divetunce trom the barert node is phen as an par All neightoring cily-distarce pairs are lised a har the heutible. node to Zetind. Sbu ard Trmisaxin which are 75 , 149 and 15km andy from Anat Notce that since Bucharest is the End nose which is why it hat a heuctic of o In console: Start node: Arad Destination: Bucharest Sample output Path: Arad os Sblu . Firrinicu or Phesf or Bucharest Total distance: 418km PATH FCENG