Consider a ship is in the sea with citizens, the agent of the ship has been provided with the detailed Map and Distances of the cities. Find the shortest path where the agent can drop all the citizens to their cities accordingly by covering the required cities and calculating the distance. Also, find the total path cost.

159 B 110 59 108 A 98 G 92 F 132 120 102 68 ) E 89 1 Note: 1. Explain the environment of the agent [20% weightage] 2. Identify the appropriate Uninformed search algorithm [20% weightage] 3. If there exists a path, then find the path and cost [20% weightage] 4. Use appropriate data structures and implement a search algorithm to find the path that the agent can visit all the cities in the graph. [40% weightage] 5. The starting point is to be obtained from the user as input 6. The ship may contain multiple citizens and hence multiple destinations(goals) are possible, and this must be obtained from the user as an input. 159 B 110 59 108 A 98 G 92 F 132 120 102 68 ) E 89 1 Note: 1. Explain the environment of the agent [20% weightage] 2. Identify the appropriate Uninformed search algorithm [20% weightage] 3. If there exists a path, then find the path and cost [20% weightage] 4. Use appropriate data structures and implement a search algorithm to find the path that the agent can visit all the cities in the graph. [40% weightage] 5. The starting point is to be obtained from the user as input 6. The ship may contain multiple citizens and hence multiple destinations(goals) are possible, and this must be obtained from the user as an input