Type out the Java code for a static method called cutList() that takes in a LinearNode parameter called front, which indicates the first node of a Linked List structure containing Characters. This method must remove every second node in the list beginning with node #2, then #4, etc. All the correct connections must be established so that the final Linked List can be traversed from start to finish. Nothing should be returned from this method, but the list beginning at front will be changed from the method. The following is an example of what would be returned (bottom) given the input array A (top), but note that your method must work for lists of either even or odd numbers of nodes and perform the same process of removing alternating nodes for any list length. front CD F front A - CE Include comments to help explain the steps involved in the method. The method signature must be: public static void cutlist (LinearNode front)