Consider the following version of hill climbing: at initialstate s we randomly choose one of s's neighbors with equal probability. If the chosen neighbor has a strictly better score than s we move to the neighbor; otherwise we stay at s. Assume s has n neighbor, and only one of the n neighbors has strictly better score than s. What is the chance that we move outof s in T interaction or less