Use Bubble sort to sort the sequence: 5, 17, 31, 14, 2, 16, 19, 18, in increasing order. i. List all exchanges, ii- List the total number of passes, iii- List the total number of comparisons. Use the binary search algorithm to search the sequence: 13, 41, 45, 15, 16, 7, 8, 19, 10, 11, 50 to find the element 19 from the sorted sequence. List the number of comparisons Estimate the Big-O of the following: a) f1 = 40n^2 + 100n + 30n^3 b) f2 = 10n^2 + 3n + 2" c) f3 = n*log(n) + n*log(2)^n d) f4=n + log(20n) c) f5 = n*log(n)+n! f) f6 = log(log(n))+log(n)+n g) f7 = n+n* log (4) + 100000 h) f1*f2 I) f3 + f4 + f5