2. Show the red-black trees that result after successively inserting the keys in the order 35, 40, 37, 19, 12, 8 into an initially empty red-black tree.

3. Show the red-black trees that result after the successively deletion of the keys in the order 8, 12, 19, 37, 40, 35 from the final red-black tree of question 2.

Describe your algorithm in English (not with pseudo code);

Show why the algorithm is correct;

Analyse the complexity of the algorithm.