3. Simplex Algorithm. Suppose that n vertices of a simplex are ranked, with no ties, in order from worst to best. In the simplex algorithm, if you are currently at the jth best vertex, in the next step you will move to one of the j - 1 better vertices, with equal probability of moving to each. With B denoting the best vertex, let Mj be the expected number of steps to reach B starting from the jth best vertex. Show that for j 2