NEED RESPONSE ASAP.

PLEASE ANSWER COMPLETELY. WILL GIVE THUMBS UP FOR A CORRECT COMPLETE ANSWER.

1. Memory Allocation Analysis: Describe your process for calculating memory required for the following examples. Give an estimate in MB/GB of the amount of memory required in RAM.

(a) Array of Doubles that contains 100,000 elements.

(b) Linked List of chars contains 1,000,000 nodes.

2. Describe the purpose of implementing a Queue, Stack, or Hashmap on an Array or Linked List. Describe why one would implement a Queue, Stack, or Hashmap.

3. 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.

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