Question 3 3 pts You are writing a pointer-based, double-linked, non-circular list using a Node class with fields called "prev", "data" and "next". Which code fragment would remove the first node in the list? tail.prev.next nul: tail-tail. prev: O head.next.prev = null: tail- head.next; head.next.prev-null: head-head.next; O tail.next.prev-nul: head head.next