Consider the following variant of a tree-connected SIMD computer. In addition to the edges of the tree, two-way links connect processors at the same level (into a linear array), as shown in Fig. 3.10...

Consider the following variant of a tree-connected SIMD computer. In addition to the edges of the tree, two-way links connect processors at the same level (into a linear array), as shown in Fig. 3.10 for a four-leaf tree computer. Assume that such a parallel computer, known as a pyramid, has n processors at the base storing two sorted sequences of total length n, one element per processor. Show that I((n/log n) is a lower bound on the time required for merging on the pyramid.