Which of the following methods correctly inserts a value x at the front of the list and returns a reference to the new front of the list? public Node insertFront(Node first, int x) first = = new Node(); first.element = x; first.next = first; return first; public Node insertFront (Node first, int x) first = new Node(); first.element = x; first.next = first; return first; ) public Node insertFront (Node first, int x) Node n - new Node(); first = n; n.element - * n. next = first; return first