Given an unsorted sequence: 11, 9, 7, 13, 8, 12, 10. Sort the sequence step by step, by using each algorithm shown in sorting.py, including: 1. Bubble sort 2. Insertion sort 3. Selection sort 4. Quick sort 5. Merge sort 6. Heap sort 7. Radix sort 8. Bucket sort 9. Counting sort You need to show the sequence after each step to illustrate how each algorithm sorts the sequence. Write your answers on paper and submit an electronic version of it. Construct an AVL tree, a 2-4 tree, and a red-black tree. 1. First Insert the keys in the listed order: 11, 14, 12, 5, 25, 4, 8, 15, 9, 13, 6, 2. 2. Then remove the keys: 12, 11, 5, 25, 8, 4 in the listed order. 3. Draw the tree after each operation. Activate Go to Settin