(Solved): C++ cs1CHW11b Unlike list and deque, vector does not have a push_front() funtion. However, vect ...

$\mathrm{cs}1\mathrm{C}?\mathrm{HW}11\mathrm{b}$ Unlike list and deque, vector does not have a push_front() funtion. However, vector does have an insert() function that can be used to insert a value at the front ( index [0] ) But remember that before a value can be inserted at the front of a vector, all values must be moved 'down' one to make room for the new value to be inserted at index [0]. This is a very significant processing penalty, $O(n)$ to move all values, just to insert one value at the front. It would seem logical that a list would perform best. When a value is inserted at the front of a list, no values in the list are moved. That is also true with a deque, but deques have additional processing related to keeping track of pointers and periodically creating a new chunk. However, each time a value is inserted at the front of a vector, all array values must be moved. So a vector should perform poorly compared to a list or deque. Write the following program and see the results. Write a program that compares the runtimes of these: - vector insert() - list push_front() - deque push_front() - Using a for loop, insert $300,000$ integers into the front of a vector. - Use a timer to measure the time. - Then use a for loop and the push_front() function to push $300,000$ integers into a list. - Use a timer to measure the time. - Then use a for loop and the push_front() function to push 300,000 integers into a deque. - Use a timer to measure the time. /* ---- OUTPUT ---------------- list time: $\mathbf{XXX}$ seconds. vector time: $\mathbf{xx}\mathbf{x}$ seconds deque time: $\mathbf{xx}$ seconds */ // Comparing runtimes - vector insert() vs list push_front() // vs deque push_front () $//(300,000$ values $)$ \#include \#include$>$