For each item listed below, explain the information on the graph interms of the operation’s efficiency class (BigOh). Compare and contrast theoperations performed on the different data structures. Identify and
describepatterns in the graph, including peaks, trends, variability. Provide a concrete,real-world example where
the operation is used and then select the containerbest suited. Your selection should be supported by the data
collected andgraphed. Explain why you selected the one you did, and why you did notselect the others. Your
entire response should be about 2 full pages (1/2-inchmargins, 10-point Times New Roman font, single
spaced, well-formedgrammatically correct sentences, etc.).
a. Inserting into a Binary Search Tree versus a Hash Table.
b. Removing from a Vector at the back versus the front