Write a Java program to implement the 2 part K-coloring problem described below: First step: After you read data, you are going to determine whether the graph is colorable using K colors where K is the second parameter from the command line. The following is the part of the algorithm that you need to implement in this assignment.
![Algorithm Algorithm](http://2.bp.blogspot.com/-2b-5eJvqx7Y/ULyMWdlWOXI/AAAAAAAAAQM/L_WRz31tMNw/s1600/mColor.jpg)
![Recursion Recursion](/uploads/1/2/5/3/125371215/844921878.jpg)
With graph coloring, any greedy algorithm will always run into cases where it makes the wrong choice and runs into a Busted case, even when there is a possible coloring. Eric's backtracking algorithm starts out greedily, but once it hits a Busted case, it 'backtracks' and tries a different choice. Before solving this Java programming exercises you should have finished the Java backtracking algorithm to solve Sudokus. You can create new Sudoku puzzles by inserting n random numbers in the range from 1 - 9 and checking for each new number, whether the rules of the game still apply or not.