(a) Determine exactly when a complete graph Kn has an Euler path or Euler circuit.

(b) Determine exactly when a complete bipartite graph Km,n has an Euler path or Euler circuit.

(c) In the cases where Kn does not have an Euler path or Euler circuit, determine the smallest number of edges that need be removed for the graph to contain an Euler path or Euler circuit.

I tried mant times to solve this but I couldn't.

I know that an path is a path that travels through every edge of a graph once and only once; an Euler circuit is an Euler path thatstarts and ends at the same vertex.