5.6 Present a synchronous algorithm for solving the k-set consensus problem in the presence of f = n 1 crash failures using an algorithm for consensus as a black box. Using Algorithm 15 as the black box, the round complexity of the algorithm should be (+1), and its message complexity should be O(IVI), where IV is the number of possible input values. For simplicity assume that k divides n.