Problem 2. Consider the metrical task system consisting of two states, 1 and 2, where the distance between the states is 1; and two tasks, (0,2) and (1,0). The deterministic competitiveness of this MTS is 3/2. Find the randomized competitiveness against the oblivious adversary, and prove your answer, both as an upper and a lower bound.