Question 3 (20 points): a) Illustrate the operation of Bottom-Up sort algorithm on the array {2, 17, 19,5, 13, 11, 4, 8, 15, 12, 7}. (Show the array after each outer loop iteration) b) How many comparisons are performed by the algorithm on the above array? Question 4 (30 points): Express the following in terms of the O-notation (You must prove your answer) a) 2n + 3(log n)90 b) 7n3 + 10 n logn c) n log n + 7