In the Edge Coloring problem, the given is a graph G and a positive integer k and the question is whether k colors can be assigned to the edges of G so that two edges with a common endpoint must be assigned different colors. 1.Show how you can formulate Edge Coloring as a CSP problem. 2.What would the MRV heuristic be/do in this case? 3.Describe how you can modify the problem so you can use local search to solve it. What would you choose as a possible effective strategy in this case?