c++ please

Objectives: - Practice use of time libraries to analyze runtimes - Practice altering and extending existing code base to meet new criteria - Better understand usage of BSTs and AVLs Assignment: The goal of this assignment is to create various test setups to analyze the various pros and cons of several of our Data Structures. The structures used in this program are Linked Lists, Binary Search Trees, and AVL Trees. The majority of the codebase is already setup with two sample tests. The assignment will require the creation of several more tests such as timings for creations of Data Structures, searching for various amounts of elements within Data Structures, and analyzing how much better a particular structure is at one goal compared to another. In addition to creating the tests, there will also be questions testing the knowledge of what is happening and why it is happening. The tests and questions will be located in a separate document. For this assignment, I highly suggest using the following line to compile the code. There are several files, and the c++11 standard will be required. Using ".cpp grabs every cpp file in your directory, so do be careful if using this in the future. EndeavouroS | fsh | [03:38:15] devin e devin-endeavour-7950x in Course-DataStruct/Timing clang ++std=c++11.cpp EndeavouroS | fsh | [03:38:49] devin e devin-endeavour-7950x in Course-DataStruct/Tining ./a.out =me Test 1=m 2: 21351 Hs / Value Count: 63267 7: 21226s | Value Count: 63268 8: 21439S | Value Count: 63124 9: 21825s | Value Count: 63263 ./ a.out === Test 1 == 2: 21351 us | Value Count: 63267 3: 21222 us | Value Count: 63322 4: 21471 ps | Value Count: 63342 5: 21180 Hs | Value Count: 63178 6: 21563 Hs I Value Count: 63181 8: 21439 Hs | Value Count: 63124 10: 21540 Hs | Value Count: 63132 == Test 2 =m= LL: 551229s BST: 1708s AVL: 1426s 1. - Create a test that analyzes the timing difference of structure creation between Linked Lists and BSTs - You may use the first sample test provided as a basis - Create a for loop that will iterate at least 10 times - Initialize your Linked List and BST objects - Create a vector of at most 750,000 elements (remove duplicates entries) - Using 2 separate loops, loop through the vector while inserting each element to your data structure - You should have 2 timing durations per loop (we did 10 test loops) - The L.L start tPoint goes before the loop used to insert data - The LL stop tPoint goes after the loop used to insert data - The BST start tPoint goes before the loop used to insert data The BST stop IPoint goes after the loop used to insert data - Create a test that analyzes the timing difference of data lookup between Linked Lists and BSTs - You may use the second sample test provided as a basis - Create a for loop that will iterate at least 10 times - Initialize your Linked List and BST objects - Create a vector of at most 200,000 elements (remove duplicates entries) - Create a vector of at least 10,000 elements (do not remove duplicates entries) - Using a single loop, loop through the first vector while inserting each element to both the Linked List and BST - Using 2 separate loops, loop through the second vector while searching for each element in your data structure - You should have 2 timing durations The LL start tPoint goes before the loop used to search data - The LL stop tPoint goes after the loop used to search data The BST start tPoint goes before the loop used to search data The BST stop tPoint goes after the loop used to search data - Create a test that analyzes the timing difference of structure creation between BSTs and AVLs - You may use the first sample test provided as a basis - Create a for loop that will iterate at least 10 times - Initialize your BST and AVL objects - Create a vector of at most 500,000 elements (remove duplicates entries) - Using 2 separate loops, loop through the vector while inserting each element to your data structure - You should have 2 timing durations per loop (we did 10 test loops) The BST start tPoint goes directly before the loop used to insert data The BST stop tPoint goes directly after the loop used to insert data The AVL start tPoint goes directly before the loop used to insert data The AVL stop tPoint goes directly after the loop used to insert data 4. - Create a test that analyzes the timing difference of data lookup between BSTs and AVLs - You may use the second sample test provided as a basis - Create a for loop that will iterate at least 10 times - Initialize your BST and AVL objects - Create a vector of at most 300,000 elements (remove duplicates entries) - Create a vector of at least 20,000 elements (do not remove duplicates entries) - Using a single loop, loop through the first vector while inserting each element to both the BST and AVL. - Using 2 senarate loons loon thmuch the second vector while searchine for - Create a test that analyzes the timing difference of data lookup between BSTs and AVLs - You may use the second sample test provided as a basis - Create a for loop that will iterate at least 10 times - Initialize your BST and AVL objects - Create a vector of at most 300,000 elements (remove duplicates entries) - Create a vector of at least 20,000 elements (do not remove duplicates entries) - Using a single loop, loop through the first vector while inserting each element to both the BST and AVL. - Using 2 separate loops, loop through the second vector while searching for each element in your data structure - You should have 2 timing durations - The AVL start tPoint goes before the loop used to search data - The AVL stop tPoint goes after the loop used to search data - The BST start tPoint goes before the loop used to search data - The BST stop tPoint goes after the loop used to search data - Create a test that analyzes the timing difference of structure creation and data lookup among Linked Lists, BSTs, and AVI.s - Create a for loop that will iterate at least 10 times - Initialize your Linked List, BST, and AVL objects - Create a vector of at most 500,000 elements (remove duplicates entries) - Create a vector of at least 30,000 elements (do not remove duplicates entries) - Using 3 separate instances of 2 loops, do the following - Loop through the first vector while inserting each element to your data structure - Loop through the second vector while searching for each clement in your data structure - You should have 3 timing durations per loop (we did 10 test loops) - The LL start tPoint goes before the loop used to insert data - The LL stop tPoint goes after the loop used to search data - The BST start tPoint goes before the loop used to insert data - The BST stop IPoint goes after the loop used to search data. - The AVL start tPoint goes before the loop used to insert data - The AVL stop tPoint goes after the loop used to search data 1. How does a Linked List compare to an AVL regarding creation? Explain your reasoning. 2. How does the search time for a BST compare to an AVL? Explain your reasoning. 3. Which structure has the best creation time? Why is that? 4. Which structure has the best search time? Why is that? 5. Does the creation time matter as much as the lookup time? Why or why not