15.8 Show that for every integer m 1, there exists an object with consensus number m. Hint: Consider a variation of an augmented queue that can hold up to m values; once a processor attempts to enqueue the (n + 1)st value, the queue "breaks" and returns a special response to every subsequent operation.