Write a program to find a cluster editing solution of size k or less on a (not necessarily connected) undirected, unweighted graph.
Your program should take as command line arguments the name of a graph file and a nonnegative integer k.
It should output a list of k or fewer edge insertions and/or deletions that transform the graph into a cluster graph or a message that the graph has no solution for the given k.
The output should look very similar to the following /clustered it graph8 txt 3 insert (0, 2) insert (3,5) delete (2, uster edit graph8.txt 2 no solution