Problem 9.5 - A graph has an Euler Circuit if and only if (a) the graph is connected and (b) the degree of every vertex is even. Find a lower bound for the time complexity of all algorithms that...

Problem 9.5 - A graph has an Euler Circuit if and only if (a) the graph is connected and (b) the degree of every vertex is even. Find a lower bound for the time complexity of all algorithms that determine if a graph has an Euler Circuit. In which of the three general categories discussed in Section 9.3 does this problem belong? Justify your answer.

Problem 9.18 - Implement an approximation algorithm for the Traveling Salesperson problem, run it on your system, and study it's performances using several problem instances.

NEED CODE well comment and explain

(Hint for 9.18:
https://stemlounge.com/animated-algorithms-for-the-traveling-salesman-problem/ (Links to an external site.))

Untitled document Problem 9.5 - A graph has an Euler Circuit if and only if (a) the graph is connected and (b) the degree of every vertex is even. Find a lower bound for the time complexity of all algorithms that determine if a graph has an Euler Circuit. In which of the three general categories discussed in Section 9.3 does this problem belong? Justify your answer. Problem 9.18 - Implement an approximation algorithm for the Traveling Salesperson problem, run it on your system, and study it's performances using several problem instances. NEED CODE well comment and explain (Hint for 9.18: https://stemlounge.com/animated-algorithms-for-the-traveling-salesman-problem/ (Links to an external site.)) https://stemlounge.com/animated-algorithms-for-the-traveling-salesman-problem/ https://stemlounge.com/animated-algorithms-for-the-traveling-salesman-problem/