1. Give an example of two sorting algorithms whose execution profiles depend strongly on the distribution of data in the array to be sorted. Discuss how data distribution affects the execution profiles. 2. Discuss some possible motivations for changing the tree data structure presented in Discuss whether (and why) the change of data structure requires a change of algorithms.