Implement and analyze the complexity of the following nonrecursive version of mergesort. F...

Implement and analyze the complexity of the following nonrecursive version of mergesort. First, merge subarrays of length 1 into two-cell subarrays, possibly one of them being a one-cell array. The resulting arrays are then merged into fourcell subarrays possibly, with one smaller array, having one, two, or three cells, and so on, until the entire array is ordered. Note that this is a bottom-up approach to the mergesort implementation, as opposed to the top-down approach discussed in this chapter.