Write a function implementation that overloads the == operator of a dynamic sequence container (linked list) class to lest if two object have the same data sets. What type of structure (static array, dynamic array, linked list, doubly linked list, stack or queue) would you use to manipulate a simple grocery list? Explain why the other structures would not work as well. Explain at least two errors that can occur when using a stack. What can be done (as pan of a stack class) to ensure the errors do not cause data errors? What can be done (as part of the program using the stack) to ensure the errors do not occur? Show the state of the private member variables of s before and after each line of the code executes. You can number the lines for reference. (the Slack class below is implemented using a linked list) Stack s; s.push(1); s.push(2); s.push(3); cout * is_at(node* head_ptr, node* p)//Precondition: head_ptr is the head pointer of a linked list (which may be empty).//The pointer p is a non-NULL pointer to some Node on some linked list.//Postcondition: The return value is the location of p on the list. If p is not//contained within list pointed to by head_ptr, return NULL