//Reverse the first k elements of a queue using an auxiliary stack. Leave the //rest of the queue the same. Update the original queue. #include #include #include using namespace std; void reverseKElementsQueue(queue &q, int k) { // Code goes here } vector stackWrapper(vector v, int k) { queue q; for (auto el : v) { q.push(el); } reverseKElementsQueue(q, k); vector updated = {}; while(!q.empty()) { updated.push_back(q.front()); q.pop(); } return updated; }