in this problem, you will study the number of iterations of this algorithm. assume the given formula do has a valid assignment, s. let x t be the number of variables that have the same value as in s after t iterations. denote by n the number of variables of the boolean formula.
