STL quiz - 2, Q3

#1

Shouldn’t answer be O(N) since there would be N recursive calls?

#2

Watch the argument in function, it’s pass by value not pass by address. So for n calls, each time size of n vector is copied into some other vector
N times , copying size of one vector in another results to O(N^2)