Answer and please explain this question from Algorithm Design and Analysis subject. Thanks and will rate.

Question 1:Consider a Stack of n integers where n> 2. Using Push (item), Pop0, and Top O functions, call the sequence of functions to remove the third from the top item of the stack. All the remaining items should remain in the stack after this (see an example below). Note that Top O returns the top item from the stack while Pop) removes the top item from the stack. Here is an example. Current Stack in 12 14 10 23 17 12 14 23 17 Question 2:Consider a singly linked list. Write a function to find the size (the number of nodes) of the linked list