Problem 1: Constraint Satisfaction Problem. Consider a CSP with 5 Boolean variables, P, Q, R, S, T, and the following constraints (the sentence of each constraint must be True): Variable Values iii) TVQ iv) S VT a. Is this CSP arc consistent? b. If not, apply AC-3 and cross off any inconsistent values in the table to the right using a slash like this:/ Problem 1: Constraint Satisfaction Problem. Consider a CSP with 5 Boolean variables, P, Q, R, S, T, and the following constraints (the sentence of each constraint must be True): Variable Values iii) TVQ iv) S VT a. Is this CSP arc consistent? b. If not, apply AC-3 and cross off any inconsistent values in the table to the right using a slash like this:/