For this practice lab you will need to download the starter code. This code contains a class called LinkedList with two methods implemented-add and print. There is also a class called Driver, which has a main method that creates a new list, adds some items, and prints them out. Your task is to write a third method in the Linked List class, called printWithSkips. This method should have the following behavior: Prints the first item in the list, skips zero Prints the second item in the list, skips one Prints the fourth item in the list, skips two Prints the seventh item in the list, skips three ... and so on until it reaches the end of the list Note: Be sure to handle the case where the last item in the full list is not one that should be printed.

The numbers on the left margin denote line numbers. line#01 class LL_node {02     int val;03     LL_node next;04     public LL_node (int n) {05         val = n;06         next = null;07     }08     public void set_next (LL_node nextNode) {09         next = nextNode;10     }11     public LL_node get_next () {12         return next;13     }14     public void set_value (int input) {15         val = input;16     }17     public int get_value () {18         return val;19     }20 }21 public class LL {22     protected LL_node head;23     protected LL_node tail;24     public LL () {25         head = null;26         tail = null;27     }28     public int append (int n) {29         if (head == null) {30             head = new LL_node(n);31             tail = head;32         } else {33             LL_node new_node;34             new_node = new LL_node(n);35             tail.set_next (new_node);36             tail = new_node;37         }38         return n;39     }40 } which the following statement…

class BSTNode  {      int key;      BSTNode left, right;        public BSTNode(int item) {            key = item;            left = right = null;      } }     class BST_Tree  {            BSTNode root;        BST_Tree()  {   // Constructor            root = null;      }       boolean search(int key){         return (searchRec(root, key) != null);     }          public BSTNode searchRec(BSTNode root, int key) {          if (root==null || root.key==key)            return root;              if (root.key > key)            return searchRec(root.left, key);              return searchRec (root.right, key);     }              void deleteKey(int key) {            root = deleteRec(root, key);      }      /* A recursive function to insert a new key in BST */      BSTNode deleteRec(BSTNode root, int key) {            /* Base Case: If the tree is empty */            if (root == null) return root;              /* Otherwise, recur down the tree */            if (key < root.key)…

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…