3. Greedy Descent The figure below shows a portion of the CSP representation for this problem, showing three variables representing three of our intersections, and constraints relating to those intersections. C1 is the constraint that says intersection 1 must have a stop sign, and C2 and C3 state that consecutive intersections cannot both have stop signs or both be uncontrolled. The figure also shows that we have randomly initialized the values for each variable, so that intersection 1 is uncontrolled, intersection 2 is uncontrolled, and intersection 3 has a roundabout. We carry out Greedy Descent with a two-stage process: selecting the variable with the most conflicts, and assigning a value to that variable that minimizes the conflicts. Question D. Given all of the information above, which variable will we first select and what value will we assign to it? 4. Random Walk Question E. With the same partial CSP shown in the figure, would we be likely to find a solution within 100 steps using only random walks