please use solver in excel

Seervada Park has recently been set aside for a limited amount of sightseeing and backpack hiking. Cars are not allowed into the park, but there is a narrow, winding road system for trams and for jeeps driven by the park rangers. The road system is shown below (without the curves), where location O is the entrance to the park; other letters designate the location of ranger stations (and other limited facilities). The numbers give the distance of these winding roads in miles. The park contains a scenic wonder point at station T. A small number of trams are used to transport sightseers from the park entrance to station T and back. A 7 2 2 T 5 5 4 0 B D 7 3 1 1 C E 4 Park management wishes to determine which route from the park entrance to station T has the smallest total distance for the operation of the tram. Set up and solve this problem as a linear programming problem, with an objective function and constraints