Please answer should be handwritten

Problem #$1$:

You, and your friend Benji, live in a city which has $50$ areas numbered from $1$ to $50.$ Some of the

areas are connected with bi$-$directional roads of various lengths. Your house is in $1$ and Benji's

is in $50.$ Both of you want to meet. Now propose an algorithm to choose the meeting point that

minimizes the total travel time. In other words, if the meeting area you chose is $x,$ it has the

minimum dist$(1,x)+$dist$(50,x)$ among all possible area choices.

Expected time complexity: $O(E^{*}lo{g}_2(V))$