Design an algorithm that minimises Ccmp, the number of
comparisons of two books’ labels in the alphabetical order, and
Cmov, the number of book movements (one movement is counted
whenever a book is moved from one location to another) in the worst
case. Suppose there arenbooks on the main shelf, which haveal ready
been sorted in an ascending alphabetical order. The m newly arrived
books are carried into the library on a portable shelf.
a) Scenario 1: The newly arrived...