2) Rank the following functions in terms of order notation(Big-O) from smallest to largest: 1. Ign. 2 2", 3. 6. n., 7. 40.499". 8. 3ns_3n(n4_n), 9. 2n3-100n", 10. ".666666 4. n.3333 5. gn 71 3) We have the following B+ indexing information: Block size 4KB, Key: 12B, ptr: 4B. Find how many index keys and pointers (max values) can be stored at each level. 4) Consider the following algorithm: P 0 for i-1 to m R)i return p a) Find the exact number of arithmetic operations (the total of additions and multiplications) b) c) d) performed by this algorithm, as a function of m. Determine the order of the running time What does the algorithm calculate? (Express p as a function of m). Write another algorithm to solve the same problem in constant time. Hint: use the result of the previous task