Explain

9. Explain how to use a singly linked list to implement a Stack. Give the run time of Stack operations for this implementation. (Push(), Pop(), size(), IsEmpty() and top()). (Map each Stack operation to the appropriate SinglyLinkedList operation). 10. How does the addition of a previous link for each node in a doubly linked list make deletions at the tail more efficient than with a singly linked list? Be specific. hoand