(Category: Divide and Conquer] Consider a tennis tournament where each of the n participants (numbered 1..n) plays every other player exactly once; each such match will result in a victory for one of the players, as recorded in array M[1..n, 1..n] where M[i,j] = 1 iff player i won the match against player j. Our goal is to produce a ranking for all n players, where a ranking is defined as a list R[1..q] (with q