$1.$ A company needs to deliver product to each of their $5$ stores around the Dallas, TX area. Driving distances between the stores are shown below. Find a route for the driver to follow, returning to the distribution center in Fort Worth: $($a$)$ using the Nearest Neighbor algorithm starting in Fort Worth, and $($b$)$ using the Repeated Nearest Neighbor algorithm; $($c$)$ then implement the result from $($b$)$ beginning at Arlington.