In the list below, if we need to insert a node (n) before the node E, which of the following code is true? * (2 Points) E F D a n.next = E; n.prev = E.prev; E.prev = n; n.prev.next =n; n.next = E; n.prev = E.prev; E.prev = n; E.prev.next =n; n.next = E; E.prev = n; n.prev = E.prev; n.prev.next =n; None of the above