Suppose R1 contains a pointer to a node. Which of the following will release this node by inserting it into the avail list? Select one: a.     lea R2,avail[R0]          store R2,1[R1]          store R1,avail[R0] b.     load R2,avail[R0]          lea R2,1[R1]          store R1,avail[R0] c.     load R2,avail[R0]          R2,1[R1]          store R1,avail[R0]

Source Booksh... m HBO Max AAP CS A Java Cours... Assume you have a stack, called myStack, implemented with single-linked nodes, that looks like this: 573 -> 408 -> 142 -> 886 'top' is a reference variable that points to the node containing 573, and 'count' is an internal int that holds the count of nodes (currently 4). The following code is ran: Integer firstPop = myStack.pop(); Integer secondPop = myStack.pop(); myStack.push(firstPop); myStack.push(760); myStack.push(secondPop); myStack.push(738); Select all of the following that are true at the end of this code. The variable secondPop refers to 142. O The element 760 is contained by the third node in this stack (where 'top' is considered the first node). O The count is currently equal to 6. The variable first Pop refers to 573. O The Integer held by firstPop is now the element contained by the node referenced through the top pointer. 886 is the only Integer that didn't change position in the LinkedStack. O The Integer held by second…

Question : Write a program to remove duplicates from a doubly linked list. e.g (1,2,3,4,5,2) (you will remove the 2nd duplicate) and then swap two data items in a doubly linked list. swap  address of node 2 with node 4.

Question 3: You have a list: 11 = [20, 'a', 21, 'b', 22, 'c', 23, 'd', 24, 'e', 25, 'f'] Which of the following slices would NOT return the following list? ['a', 'b', 'c', 'd', 'e', 'f'] L1[1::2] • L1[1:12:2] L1[-1:-12:-2] • L1[-11::2]