Question: Extend the algorithm SCHONING for 4SAT. Observe that the lower bound on the probability of moving toward α∗ in a local step decreases to 1/4 in this case. How many repetitions of random sampling followed by a local search are necessary to get a constant success probability?