Consider a linked list whose nodes are objects of the class Node: class Node { public int data; public Node next; } prev references a node n1 in the list and curr references the node n2 that is right after n1 in the list. Which of the following statements is used to delete the node n2? Oprev.next = curr; Ocurr.next = prev; Oprev= curr.next; Oprev.next = curr.next;

In java The following is a class definition of a linked list Node:class Node{int info;Node next;}Assume that head references a linked list and stores in order, the int values 5, 7 and 9.  Show the instructions needed to delete the Node with 5 so that head would reference the list 7 and 9.

Redesign LaptopList class from previous project public class LaptopList {       private class LaptopNode  //inner class     {         public String brand;         public double price;         public LaptopNode next;           public LaptopNode(String brand, double price)         {                // add your code         }         public String toString()         {             // add your code         }     }       private LaptopNode head; // head of the linked list       public LaptopList(String fname) throws IOException     {         File file = new File(fname);         Scanner scan = new Scanner(file);         head = null;         while(scan.hasNextLine())         {             // scan data             // create LaptopNode             // call addToHead and addToTail alternatively          }     }       private void addToHead(LaptopNode node)     {             // add your code     }       private void addToTail(LaptopNode node)     {             // add your code     }       private…

Send me your own work not AI generated response or plagiarised response. If I see these things, I'll give multiple downvotes and will definitely report.