JUST NEED THE ANSWER TO NUMBER 2 PLEASE!

Sweet Action, Inc. is making the daily cupcake run across the Oklahoma City metropolitan area. They have seven customers and have identified the driving distance (in miles) between each pairwise combination as shown in the table. One-way streets and various construction projects affect driving distances such that the distance from one to the other may not be the same depending on which site is the starting point.

From/To	SA	Bosco's	Champion	Damron	Enumclaw	Luther	Jones	Heidi
SA	0	9	97	17	22	34	55	71
Bosco's	14	0	99	29	20	39	84	53
Champion	63	8	0	90	96	89	66	78
Damron	98	90	29	0	46	88	62	13
Enumclaw	27	88	94	81	0	49	53	35
Luther	91	95	62	91	19	0	73	91
Jones	87	2	27	69	11	4	0	25
Heidi	61	31	58	13	15	92	44	0

1). Identify the most energy efficient route that begins at Sweet Action headquarter (SA) and visits each customer once, then return to headquarter (SA). (Hint: the last stop before returning to SA should be Luther)

2). The returning trip from Luther to SA is 91, which is very long. Examine Luther you may find that traveling from there to any other location is very far, except Enumclaw. Can you find a way to make the returning trip shorter than 91? Please show your returning route and distance from Luther to SA. (Congratulations! You just found a better route than the NN heuristic!)