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 three general categories discussed in section 9.3 does this problem belong? Justify your answer.(List the steps of your algorithm, determine its complexity and explain why no other solution can be quicker.)