Question 1 1pts The node that is easiest to access in a linked-chain s the head node the tail node O access time is the same for all nodes O it cannot be determined Question 2 1 pts In the Ch 6 linloed-chain implementation of a Stack ADT, the performance of popping an entry from the stack is 0(1) 02) Question 1 pts In the Ch 6 linked-chain implementation of a Stack ADT, when a node is popped from the stack O the original first node will no longer be referenced O the original first node will be dealocated the new first node will reference what was the second node in the chain O all af the above