C++ data structures algorithms. Big O

Please follow instructions thanks

Big OSECTION 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. A. Empty check method on Stack of 1000 elements with array as O(1) underlying data structure B. Traversing a Linked List from the Last Node to the Head Node O(n) o(n 2) C. Look Up of Node in a 100,000 element Binary Search Tree D. Traversing every node in Queue with array as underlying data O(log n) structure E. Accessing key in 1.000.000 element Hash Map O(n log n)