1. Order the following functions by the Big-Oh notation. log log n 250 n0.01 log n log3n 2logn 4n 10n 2n log? n n3 2. Prove the following function f(n)= n4 10n3 + 200n2 1000n is (n4). 3. Explain how you can implement all functions of the queue ADT using two stacks. Specifically, given two stacks S1 and S2 with the standard operations (push, pop, top, isempty, size), describe how you can implement the standard operations (enqueue, dequeue, front, isempty, size) of a queue. What is the time complexity for enqueue and dequeue respectively? 4. Given a binary tree, can you count the number of nodes (internal and leaf nodes) using recursion? Write the pseudo code. What is the time complexity