Every data structure that we use in computer science has its weaknesses and strengthsHaving a full understanding of each will help make us better programmers!For this experiment, let's work with STL vectors and STL dequesFull requirements descriptions are found in the source code filePart 1Work with inserting elements at the front of a vector and a deque (30%)Part 2Work with inserting elements at the back of a vector and a deque (30%)Part 3Work with inserting elements in the middle, and removing elements from, a vector and a deque (40%)Please make sure to put your code specifically where it is asked for, and no where elseDo not modify any of the code you already see in the template fileThis C++ source code file is required to complete this problem #include #include void PartOne(){// -// 1A// PROPERLY SET UP VECTOR a WITH 500000 ELEMENTS IN ORDER 1, 2, 3, 4, ..., 500000// PUT EACH ELEMENT IN THE FRONT AS YOU ADD THEM TO THE VECTOR// - - - - - - - - - - - - - -std::vector a;// --// 18// PROPERLY SET UP DEQUE b WITH 500000 ELEMENTS IN ORDER 1, 2, 3, 4, ..., 500000// PUT EACH ELEMENT IN THE FRONT AS YOU ADD THEM TO THE DEQUE// ------------std::deque b;}// - -// 10// FULLY DESCRIBE WHICH OF THE TWO OPERATIONS IS FASTER THAN THE OTHER AND WHY// EITHER USE A COMMENT, OR PRINT YOUR DESCRIPTION TO THE SCREEN}void Part Two(){// UP TO 5 POINTS (MAXIMUM 10 OVERALL) EXTRA CREDIT IF YOU CAN SHOW EVIDENCE OF// YOUR DESCRIPTION USING C++ CODE||--------// --// 2A// SET UP VECTOR a WITH 500000 ELEMENTS IN ORDER 1, 2, 3, 4,// PUT EACH ELEMENT IN THE BACK AS YOU ADD THEM TO THE VECTOR//....std::vector a;---------// --// 2C}void PartThree(){// - - -// 28// SET UP DEQUE b WITH 500000 ELEMENTS IN ORDER 1, 2, 3, 4, ..., 500080// PUT EACH ELEMENT IN THE BACK AS YOU ADD THEM TO THE DEQUE// ---------- - - - -std::dequecint b;----// FULLY DESCRIBE WHICH OF THE TWO OPERATIONS IS FASTER THAN THE OTHER AND WHY// EITHER USE A COMMENT, OR PRINT YOUR DESCRIPTION TO THE SCREEN// UP TO 5 POINTS (MAXIMUM 10 OVERALL) EXTRA CREDIT IF YOU CAN SHOW EVIDENCE OF// YOUR DESCRIPTION USING C++ CODE11// 3A// 1) INSERT RANDOMLY 5-10 VALUES OF 8 BETWEEN THE 2 AND THE 3 VALUE IN THE a VECTORFOR EXAMPLE 1,2,3,4,5 BECOMES 1,2,8,8,8,8,8,8,3,4,5 (6 WAS RANDOMLY GENERATED)// 2) EMPTY/CLEAR OUT THE VECTOR BY ONLY USING EITHER erase() OR pop_back()//// - - - - - - - - - - - - - - - - - - -std::vector a { 1, 2, 3, 4, 5 };}// You may not touch this code belowint main(){// --// 38// 1) INSERT RANDOMLY 5-10 VALUES OF 8 BETWEEN THE 2 AND THE 3 VALUE IN THE b DEQUE11FOR EXAMPLE 1,2,3,4,5 BECOMES 1,2,8,8,8,8,8,8,3,4,5 (6 WAS RANDOMLY GENERATED)// 2) PROPERLY EMPTY/CLEAR OUT THE DEQUE// ----- - - - - - - - - - - - - - --- --- - - - - - - - - - - - - ----std::deque b { new int(1), new int(2), new int(3), new int(4), new int(5) };500800// Add some variability to the random number generatorsrand(static_cast(NULL));// Work with the fronts of the vector and deque data structuresPartOne();// Work with the backs of the vector and deque data structuresPartTwo();// Cleanupsystem("PAUSE");return 0;// Work with inserting and clearing the vector and deque data structuresPartThree();

Question

Every data structure that we use in computer science has its weaknesses and strengthsHaving a full understanding of each will help make us better programmers!For this experiment, let's work with STL vectors and STL dequesFull requirements descriptions are found in the source code filePart 1Work with inserting elements at the front of a vector and a deque (30%)Part 2Work with inserting elements at the back of a vector and a deque (30%)Part 3Work with inserting elements in the middle, and removing elements from, a vector and a deque (40%)Please make sure to put your code specifically where it is asked for, and no where elseDo not modify any of the code you already see in the template fileThis C++ source code file is required to complete this problem #include #include void PartOne(){// -// 1A// PROPERLY SET UP VECTOR a WITH 500000 ELEMENTS IN ORDER 1, 2, 3, 4, ..., 500000// PUT EACH ELEMENT IN THE FRONT AS YOU ADD THEM TO THE VECTOR// - - - - - - - - - - - - - -std::vector a;// --// 18// PROPERLY SET UP DEQUE b WITH 500000 ELEMENTS IN ORDER 1, 2, 3, 4, ..., 500000// PUT EACH ELEMENT IN THE FRONT AS YOU ADD THEM TO THE DEQUE// ------------std::deque b;}// - -// 10// FULLY DESCRIBE WHICH OF THE TWO OPERATIONS IS FASTER THAN THE OTHER AND WHY// EITHER USE A COMMENT, OR PRINT YOUR DESCRIPTION TO THE SCREEN}void Part Two(){// UP TO 5 POINTS (MAXIMUM 10 OVERALL) EXTRA CREDIT IF YOU CAN SHOW EVIDENCE OF// YOUR DESCRIPTION USING C++ CODE||--------// --// 2A// SET UP VECTOR a WITH 500000 ELEMENTS IN ORDER 1, 2, 3, 4,// PUT EACH ELEMENT IN THE BACK AS YOU ADD THEM TO THE VECTOR//....std::vector a;---------// --// 2C}void PartThree(){// - - -// 28// SET UP DEQUE b WITH 500000 ELEMENTS IN ORDER 1, 2, 3, 4, ..., 500080// PUT EACH ELEMENT IN THE BACK AS YOU ADD THEM TO THE DEQUE// ---------- - - - -std::dequecint> b;----// FULLY DESCRIBE WHICH OF THE TWO OPERATIONS IS FASTER THAN THE OTHER AND WHY// EITHER USE A COMMENT, OR PRINT YOUR DESCRIPTION TO THE SCREEN// UP TO 5 POINTS (MAXIMUM 10 OVERALL) EXTRA CREDIT IF YOU CAN SHOW EVIDENCE OF// YOUR DESCRIPTION USING C++ CODE11// 3A// 1) INSERT RANDOMLY 5-10 VALUES OF 8 BETWEEN THE 2 AND THE 3 VALUE IN THE a VECTORFOR EXAMPLE 1,2,3,4,5 BECOMES 1,2,8,8,8,8,8,8,3,4,5 (6 WAS RANDOMLY GENERATED)// 2) EMPTY/CLEAR OUT THE VECTOR BY ONLY USING EITHER erase() OR pop_back()//// - - - - - - - - - - - - - - - - - - -std::vector a { 1, 2, 3, 4, 5 };}// You may not touch this code belowint main(){// --// 38// 1) INSERT RANDOMLY 5-10 VALUES OF 8 BETWEEN THE 2 AND THE 3 VALUE IN THE b DEQUE11FOR EXAMPLE 1,2,3,4,5 BECOMES 1,2,8,8,8,8,8,8,3,4,5 (6 WAS RANDOMLY GENERATED)// 2) PROPERLY EMPTY/CLEAR OUT THE DEQUE// ----- - - - - - - - - - - - - - --- --- - - - - - - - - - - - - ----std::deque b { new int(1), new int(2), new int(3), new int(4), new int(5) };500800// Add some variability to the random number generatorsrand(static_cast(NULL));// Work with the fronts of the vector and deque data structuresPartOne();// Work with the backs of the vector and deque data structuresPartTwo();// Cleanupsystem(&#34;PAUSE&#34;);return 0;// Work with inserting and clearing the vector and deque data structuresPartThree();

Accepted Answer

Here is the code: