If you are given the graph K=(V,E) with V = {T, U, V, W, X,…

If you are given the graph K=(V,E) with V = {T, U, V, W, X, Y} and E = {{T,U}, {T,Y}, {U,Y}, {U,W}, {U,V}, {V,Y}, {V,W}, {W,X},{W,Y}}, what is the minimum number of edges you would have to add to have an Euler circuit? List the edge(s) you would add or write none if applicable.