1.Describe an algorithm that takes as input a list of n distinct integers and finds the location of the smallest odd integer in the list or returns 0 if there are no odd integers in the list. 2. List all the steps necessary to perform a) linear search, b) binary search for 25 in the below sequence: 2, 7, 13, 18, 21, 24 3. Use the bubble sort to sort, 7, 3, 1, 2, 4, 5, showing the lists obtained at each step