please use python file and put the number in front of the answer so i can know which answer match which question

1.

Consider the following list of integers: [10,9,8,7,6,5,4,3,2,1]. Show how this list is sorted by the following algorithms:

bubble sort

selection sort

insertion sort

shell sort (you decide on the increments)

merge sort

quick sort (you decide on the pivot value)

2.

Consider the list of characters: ['P','Y','T','H','O','N']. Show how this list is sorted using the following algorithms:

bubble sort

selection sort

insertion sort

shell sort (you decide on the increments)

merge sort

quick sort (you decide on the pivot value)

3.In the hash table map implementation, the hash table size was chosen to be 101. If the table gets full, this needs to be increased. Re-implement the put method so that the table will automatically resize itself when the loading factor reaches a predetermined value (you can decide the value based on your assessment of load versus performance).