Did I do this right? if any answers are wrong please explain why?

C++. thanks

Big O SECTION List appropriate Worst Case Big O Notation under the different algorithms or data structure operations. Choose from right column and place under left column. Right column can be used more than once or not all 10 Points Please use black, blue, or dark green font color O(n) O(n ^ 2) O(log n) O(n log n) A. Empty() check method on Queue of 1,000,000 elements with0(1]) array as underlying data structure B.. Retrieve Node in a 10,000 element Binary Search Tree C. Traversing every element in Stack with array as underlying data O(n) O(n) structure D. Accessing key in 2,000,000 element Hash Map E. Traversing a Doubly Linked List from the Head Node to the Last O(n) Node