Say that G is an undirected graph that does not contain an Euler cycle. Give an algorithm to add a set F of minimum cardinality, so that G0 (V, E + F) contains an Euler cycle. Remark: To add an edge, means that a, b are not neighbors