1. An algorithm is said to be exponential if it is :O(n),e>1[=O(c),e>1:O(1) QUESTION 10 0.5 points 1. The average case of the running time is represented by the asymptotic notation =o QUESTION 11 0.5 points 1. The storage of the following code is : void reverse(int a[], int n ) { int [] b =new int (n); int i; for (i=0;i<>