Question 1: Constraint Satisfaction Consider the following problem: Find a 10-digit number such that the first digit is the number of zeros in the number, the second digit is the number of ones in the number, ..., and the tenth digit is the number of nines in the number. The first digit must be non-zero. a) Formulate this problem as a CSP. List the variables, their domains, and the constraints. Draw the constraint graph. b) Show the first ten steps of backtracking search on this problem, where you order the variables from the first digit to the last digit, and the values from lowest to highest. Recall that backtracking search uses a depth-first strategy to expand the search tree. c) Show the first ten steps of backtracking search on this problem with one-step forward checking, where you order the variables from the first digit to the last digit, and the values from lowest to highest