Final Exam Problem 1. Prove that no randomized online algorithm for the k-server problem can have competitiveness lower than k against the adaptive online adversary, as mentioned in http://www.egr.unlv.edu/~larmore/Courses/CSC789/Serv/pg06. You will use this result to work Problem 2 of the final exam.