The implementation is based on the following two instance variables:

int count;

Stack_entry entry[maxstack];

It is easy to see that methods push, pop, top and empty have a time complexity of O(1). Assume that we now want to implement the same stack using the linked implementation given in Linked List under Lecture 1 in D2L. The implementation is based on the following two instance variables:

int count;

Node *head;

Can we achieve the same level of time complexity for each of the four methods in the linked stack? Briefly explain your answer