(Java or C++ question)

.csv file :

https://docs.google.com/spreadsheets/d/1QrxRJ5tDkQitELotRUnd7nO6JhsAyCXZ0wln_pf-bOk/edit#gid=470709724

A Map Coloring Constraint Satisfaction Problem Variables = {XO, X1, X2, ....., X49} Domains = {Red, Green, Blue, Yellow} Constraints = bordering regions must have different colors. For Example, in the following graph, XO XI, XO X2, X1+X2, (NT) (SA) INSU Based off the mentioned constraints, solve the constraint satisfaction problem for the .csv Australia map file. Use the .csv file for states names and states adjacency matrix T Your program have to read the .csv files that contain the adjacency matrix, such as those for the states of Australia (these are the "Variables) and solve the CSP- I problem. Provide a counter nya (number of variable assignments) that counts the number of times an initial color assigned to a variable or the color assigned to a variable is changed; in addition to outputting the solution to the CSV also report the value of this variable at the end of the run. Since there are 7 states in Australia, n= 7. The adjacency_matrix Aust.csv file contains 7x7 matrix indicating whether a State j is adjacent to State "L", where 1 {adj_statel:color, adj_state2.color, adj_state3.color,...} A Map Coloring Constraint Satisfaction Problem Variables = {XO, X1, X2, ....., X49} Domains = {Red, Green, Blue, Yellow} Constraints = bordering regions must have different colors. For Example, in the following graph, XO XI, XO X2, X1+X2, (NT) (SA) INSU Based off the mentioned constraints, solve the constraint satisfaction problem for the .csv Australia map file. Use the .csv file for states names and states adjacency matrix T Your program have to read the .csv files that contain the adjacency matrix, such as those for the states of Australia (these are the "Variables) and solve the CSP- I problem. Provide a counter nya (number of variable assignments) that counts the number of times an initial color assigned to a variable or the color assigned to a variable is changed; in addition to outputting the solution to the CSV also report the value of this variable at the end of the run. Since there are 7 states in Australia, n= 7. The adjacency_matrix Aust.csv file contains 7x7 matrix indicating whether a State j is adjacent to State "L", where 1 {adj_statel:color, adj_state2.color, adj_state3.color,...}