Q3. Vector STL#3 Predict the time complexity of the following recursive function, given the vector is of size N and the initial call is calSum(v, 0). int sum = 0; void calcSum(vector v, int i) { if(i == v.size()) return; sum += v[i]; calcSum(v, i+1); }

[Rhinorox (Suraj Kumar)]

STL:QUIZ 2_____________Why the answer is O(N*2) not O(N)?