a. List all orderings of the following functions so that each is big-O of the next one. n, log(n), 10000, n*n, 2**n, n*log(n), n!, log(log(n)), log(n**5) 3b. Find gcd(435,195) and express it as a linear combination of 195 and 435. 4. Describe an efficient algorithm to determine which integer appears the most times in an array A[1..n] of integers. What is the complexity of your algorithm in big-O notation? Would you use the same algorithm if it is known that the numbers in A are integers in the range 0 to 100?