1.In Example 6.12, we described the logic of the Merge operation. Construct a module that implements it. 2. In Example 6.13, we described the logic of the Mergesort algorithm. In Figs. 6.3 and 6.4, we...

module that implements it. 2. In Example 6.13, we described the logic of the Mergesort algorithm. In Figs. 6.3 and 6.4, we showed graphic representations of the total work required by Mergesort. However, these figures do not show the sequence in which the various steps occur. Trace the execution of Mergesort on the data from Example 6.13 and make an ordered list of how many times Merge is called. For each call of Merge, specify which values are merged together.