Consider the following parallel architecture consisting of n 2 processors placed in a square array with n rows and n columns. The processors in each row are interconnected to form a binary tree. The...

Consider the following parallel architecture consisting of n 2 processors placed in a square array with n rows and n columns. The processors in each row are interconnected to form a binary tree. The processors in each column are interconnected similarly. The tree interconnections are the only links among the processors. Show that this architecture, known as the mesh of trees, can sort a sequence of n elements in O(log n) time.