1. Prove or disprove the following statements: (ii) n2 log n 0(n2) (iii) 2"+ n20- 0(3") (iv) 2n2 + nlogn = (n*) (v) n1001 + n log n=0(n log n) vi) n1 +2/ V logn = O(n log n) (vii) log n + log n2+ log n: (log n) (vii) 2m (n+11+log n = (log n) (ix) (n+1)logn=(log n ) ( O(log ni/3) x) log log log n = (50 points) 2. A fast exponentiation function is given below: int expon(int x, int n) /* n is assumed> 0/ if (n = 0) return 1; else