explain why

mar e to remove a node om a dou next p. getNext(); next.setPrevious (p.getPrevious )); rev = p.getPrevious(); p. setNext(prev.getNext )); if (pfront) front -next; if (prear) rear-prev; where getNext, getPrevious, setNext, and setPrevious are a getter and setter methods from the class representing the nodes of the linked list to access and set the next node and previous node in the onsi 1s front rear front rear wit hout crashing, draw the doubly linked list resulting after it is executed on the above list (a); erwise explain W e code w cras .e. an exception W o, the above code does not corr remove no m the lis er executing th le front reai