1. Suppose we are executing Merge-Sort on the following six values --- 33, 38, 42, 44, 45, 50. Give a permutation of these values such that when Merge-Sort is applied to the permutation, no values will change position until the final Merge of the left half (3 values) and the right half (3 values), and when that merge is applied, all values will change position