. The constraint stratification problem is defined as follows. Variables: {P, Q, R, S, T} Domain: {1, 2, 3) Constraints: P#Q QUR SZT Rss 2p>T OST . . . . This CSP problem is solved using Backtracking Search with Forward Checking and Arc Consistency assuming that Backtracking Search selects variable in increasing alphabetic order and values in increasing numerical order. Fill in the following table based on the following instruction. Circle values assigned by Backtracking Search, b. Leave out values removed by Forward Checking, and Cross out values removed by Arc Consistency. d. Stop the procedure when the first solution is found. a. c. Q R S T Assignment P=1 P (1)