PPLEASE HELP AND LEGIBLE. WILL UPVOTE 2X

Q5. An implementation could potentially use any of the following data structures to implement the Queue ADT. Indicate the best-case run times if we use the listed data structures in as optimal a sense as possible. Choose the implementation that minimizes the run time of as many operations as possible. In the case of arrays, you may have to move entries if the array is not full-an O(n) operation. (20 points) Singly linked list a head pointer Singly linked list with head and tail pointers Doubly linked list with head and tail pointers One-ended array void push(...) Type pop() Type top()