What are the worst case and average case complexity, respectively, of the following code? ("rand() % k" generates a random number in the range 0..k-1 and runs in o(1) time). vector loadvector(int n) { vector v; for (int i = 0; i < n; ++i) { if (rand() % 2 == 0) for (int j = 0; j < n; ++j) v. push_back(rand() % n); } return v; }