The image below shows a map of Bikini Bottom and its surroundings. The numbers indicate how long it takes to walk from one place to another.

SpongeBob just finished his shift at the Krusty Krab. At the same time, his friend Patrick is located in the Kelp Forest. They want to meet up as soon as possible to plan how to get an autograph from David Hasselhoff. SpongeBob and Patrick start walking at the same time. Present an efficient algorithm to determine where SpongeBob and Patrick should meet so that they can meet as soon as possible. Note that the algorithm needs to be able to handle any map $($undirected graph$).$ Use the framework from homework $6$ to present the solution.