1. Choose one searching and sorting algorithm each of your choice and Describe each of the algorithm with examples i. compare their performance write the advantages and disadvantages of each algorithm ii. iii. 2. You are to sort a list L consisting of a sorted list followed by a few "random" elements. Which of sorting methods would be especially suitable for such a task? Explain your reason. 3. Which searching technique/s takes O (1) time to find a data. Give reasons. 4. Describe with illustrations number of interchanges required to sort 5, 1, 6, 2 4 in ascending order using Bubble Sort.