1. In a Linked stack implemented using singly linked list with pointer top pointing to top of the stack, which of the following statements, correctly push a node into a non-empty stack? Assume temp is...

Extracted text: 1. In a Linked stack implemented using singly linked list with pointer top pointing to top of the stack, which of the following statements, correctly push a node into a non-empty stack? Assume temp is the node to be pushed. temp = top; top->next = temp; %3! top->next = temp; temp = top %3D temp->next = top; top = temp %3D %3D top = temp; temp->next = top 2. You are given pointers to first and last nodes of a singly linked list, which of the following operations are dependent on the length of the linked list? O Insert a new element as a first element Add a new element to the end of the list Delete the first element Delete the last element of the list