Please answer all 5 questions regarding constraint satisfaction.

Consider the map of Australia. Using the colors from the domain Dcyan, magenta, orange and variables WA, NT, SA, Q, NSW, V and T for the respective states; the problem is to color the map such that the following constraints C1 and C2 are preserved: C1 - No adjacent states sharing borders should have the same color, C2 - Tasmania should not have the color cyan. In order to solve this CSP, answer the questions next. [2 points each, total 10 points] Northern Territory Western Australia Queensland South Australia New South Wale Victoria Tasman 11. If WA-cyan, which of the following is acceptable, preserving all constraints? a) NT-cyan b) Q-magenta c) Q-cyan d) NSW-cyan 12. Suppose T-orange, what is NOT acceptable herewith? a) V-orange b)SA-magenta c) NSW-cyan d) None of these 13. Given that we follow the order of the Most Constrained Variable heuristic, which state is colored first? a) WA B) NT c) SA d) NSW 14. Which of the following is an example of a conflict here? a) NT-cyan; SA-orange b) Q-magenta; NSW-cyan cV-magenta; T-cyan d)WA-cyan; NT-orange 15. How many complete and consistent solutions does this CSP have? b) 1 c) 2 d) More than 2