Question 2 Augmented data structures. A list of n different numbers is given. Thus, an increasing sequence has no inversions. By deleting the points, the index i is at all times the smallest in the tree. Question 3 Algorithms.
Answer Let x be an integer in the given range.
Note that the numbers are now sorted by last digit, large on top. After this round, the numbersare sorted by the last two digits. After seven rounds, the numbers are totally sorted.