Describe the vertices, edges, and edge weights that will convert each of the following problems into a TSP:

$1.$ A rail line from New York to San Francisco must pass through many specied cities at a minimum cost.

$2.$ A package delivery company with many trucks clusters the deliveries and assigns a truck to each cluster. Each truck should make its deliveries in minimum time.

$3.$Every morning, a physician must go from his$/$her oce to visit all ICU patients that he$/$she is taking care of$,$ who are assigned to ICU wards all over the hospital's main building, then stop by the coffee shop, and finally return to his oce.