We call a graph symmetric, if we can put its vertices on the plane such that if the edges are segments, the graph has a reflectional symmetry with respect to a line not passing through its vertices. Find the least value of K such that the edges of every graph with 100 vertices, can be divided into K symmetric subgraphs. graphcombinatoricssymmetry