Tracing execution of algorithms

Trace the execution of the following algorithms:

(a) Trace the fast divide and conquer integer multiplication method discussed in class (and in Brassard and Bratley) on the following example: 2221 is multiplied by 1211.

(b) Trace quick sort (in the textbook) on the list 9, 1, 6, 7, 4, 2, 3. Show what the array looks like after every swap (i.e. when two values are exchanged). Also, calculate the exact number of swaps the algorithm makes; when one element is exchanged with itself, that should not count as a swap.