Question 2: (3 marks) You are in charge of scheduling for computer science classes that meet weekly. There are 5 classes that meet and 3 professors who will be teaching these classes. You are constrained by the fact that each professor can only teach one class at a time. The classes are: 1. Class 1 - Intro to Programming: meets from 8:00-9:00am 2. Class 2 - Intro to Artificial Intelligence: meets from 8:30-9:30am 3. Class 3 - Natural Language Processing: meets from 9:00-10:00 am 4. Class 4 - Computer Vision: meets from 9:00-10:00am 5. Class 5 - Machine Learning: meets from 10:30-11:30am The professors are: 1. Professor A, who is qualified to teach Classes 1,2 , and 5 . 2. Professor B, who is qualified to teach Classes 3,4 , and 5 . 3. Professor C, who is qualified to teach Classes 1,3 , and 4 . I. Formulate this problem as a CSP problem. a. State the domain b. State the variables c. Unary constraints d. Binary constraints Constraints should be specified formally and precisely but may be implicit rather than explicit. II. Draw the constraint graph associated with your CSP III. What are the domains of the variables after enforcing node-consistency? IV. What are the domains of the variables after enforcing arc-consistency