The odd-even merging network described in section 3.2 is just one example from a wide class of merging networks. Show that, in general, any (r, s)-merging network built of comparators must require...

The odd-even merging network described in section 3.2 is just one example from a wide class of merging networks. Show that, in general, any (r, s)-merging network built of comparators must require S(log(r + s)) time in order to completely merge two sorted sequences of length r and s, respectively.