Please complete whenever you get a chance , will thumps up !

P1) Given functions: ( 30 points) 31000000n,5n2,n2,n3,nlogn,(logn)2,n!,nn,2n,1000100000000 List the functions as its growth rate the slowest at leftmost and the fastest at the rightmost. P2) Suppose you are given an array A of sorted integers froml to 1000. ( 60 points) A: (a) Do you think this array represents a heap (max or min)? (b) If it is a heap, what is its height? (use the maximum, minimum number of keys in a h height heap. (c) Then, what number will be the parent of 35 ? (d) What number will be the nght child of 50