() A communicator is monotonically increasing if, whenever I > J, the communication sequence for I is lexicographically smaller than that for J . Communicators Orderk are optimal and corruption tolerant; however, they are not monotonically increasing fork > 2; thus, they cannot be used in pipeline for computing the minimum. Determine a class MonotoneOrderk of optimal corruption-tolerant communicators that are monotonically increasing.