Given the following pseudo-code: stack stk; queue que; vector vec; stack stk; queue que; vector vec; for (int i = 0; i < 10; i++) (stk.push(i); } for (int i = 0; i < 10; i++) (que.enqueue (i); } for (int i = 0; i < 10; i++) { } int elem = 10; if (i %30) { elem stk. top(); stk.pop(); ) } else if (i 8 2 == 0) { } elem = que.front(); que.dequeue(); vec[i] elem; What would the vector vec contain after the final loop? 15 p