$(25$ points$)$ Using the graph below, use various algorithms to "solve" the traveling salesman problem:

a$.$ Determine the CLA solution. What is the pathway and what is the distance?

b$.$ Determine the RNNA solution. What is the pathway and what is the distance?

c$.$ Determine the brute force solution. What is the pathway and what is the distance?

d$.$ Which solution method produced the truly best $($i$.$e$.,$ global, mathematically optimized$)$ solution here?

e$.$ Which solution method produced the "best" solution here if we consider both the time it took to find each one and the actual values the objective functions achieved? Explain your reasoning.