Knockout Implementation: There are dependencies between the knockout trees. The simplest implementation passes all the losers from the Position j - 1 tree to the Position j tree. This would take k log...

Knockout Implementation: There are dependencies between the knockout trees. The simplest implementation passes all the losers from the Position j - 1 tree to the Position j tree. This would take k log N gate delays, because each tree takes log N gate delays. Find a way to pipeline this process such that Tree j begins to work on each batch of losers as they are determined by Tree j - 1, as opposed to waiting for all losers to be determined. Draw your implementation using 2-by-2 concentrators as your building block and estimate the worst-case delay in concentrator delays.