Please answer the following Questions with A,B,C... and I will give a thumbs up

If you can give a little context to why you chose that answer that'd be great too.

Which of the following are the right steps to remove and return the linear node pointed to by current if it is not the first node in the list and previous points to the node before current.

Question 1

	previous.setNext(current.getNext()); return current;
	current.setNext(previous.getNext()); return previous;
	current.setPrevious(current.getNext()); return previous;
	previous.setNext(current.getPrevious()); return previous;

Which of the following are the right step(s) to remove the first node of a linked list?

Question 2

	front = front.getNext();
	if (front == rear) rear = front.getNext(); front = front.getNext();
	front.setNext(rear);
	none of the above

Which of the following are the right step(s) to remove the last node of a linked list assuming that current points to that node and that previous points to the node before current?

Question 3

	previous.setNext(current); rear = current;
	rear.setPrevious(previous);
	previous.setNext(null) rear = previous;
	none of the above

Which of the following are the right steps to advance the pointers in a loop that must keep track of current and previous while traversing a linked list?

Question 4

	previous = current; current = current.getNext();
	current = current.getNext()
	previous = current;
	previous = current; current = current.next;