Can you please fill out the table. PLEASE FILL OUT THE TABLE

Question 1. (25 points) Use the AC-3 algorithm to show that arc consistency is able to detect the inconsistency of the partial assignment {WA= green, V= red } for the map-coloring problem shown on the slides. The slides show the map of Australia and the constraint graph. Show your work by completing the following table and expanding it if necessary. Start with the full list of the arcs to be checked. Remember to include arcs in both directions. For each arc consistency check, show the values remaining in the domain of the variable. If there are any arcs re-inserted into the queue show them in the last column. During the process, you may reorder the remaining arcs to arrive at the inconsistency faster. Variables: WA,NT,Q,NSW,V,SA,T Domains: Di={ red, green, blue } Constraints: adjacent regions must have different colors e.g., WA=NT (if the language allows this), or (WA,NT){( red, green ),( red, blue ),( green, red ),( green, blue ),}