Write the following method in Java: public void reverse() The method will reverse the linked list. Head will point to the last node of the linked list and all he pointers (addresses) will be reversed. The last node (a new head) will point to the second last hode and so on. The old head node will become the tail node in the reversed LinkedList. Use the LinkedList class discussed in the video lecture and write the reverse() method in the same class. Test your method in the main method. Following picture depicts the reversal of the LinkedList. NULLE Head I V I>I>G>\ BER >> NULL BH ↑ Head

please fix code to match "enter patients name in lbs"   thank you import java.util.LinkedList;import java.util.Queue;import java.util.Scanner; interface Patient {     public String displayBMICategory(double bmi);     public String displayInsuranceCategory(double bmi);} public class BMI implements Patient {     public static void main(String[] args) {         /*         * local variable for saving the patient information         */        double weight = 0;        String birthDate = "", name = "";        int height = 0;        Scanner scan = new Scanner(System.in);        String cont = "";        Queue<String> patients = new LinkedList<>();         // do while loop for keep running program till user not entered q        do {             System.out.print("Press Y for continue (Press q for exit!) ");            cont = scan.nextLine();            if (cont.equalsIgnoreCase("q")) {                 System.out.println("Thank you for using BMI calculator");                break;…

Question 2: Using only LLNode java cass. Create a demo cass called LinkedlistDemo java. In this demo class, write a public static method called SumNode that receives a reference caled list of type LLNode of integer values. Your method shoukl sum all the nodes content and then add a new node contains the summation to the end of the list. For example, if the list contains: list Then after calling the method SumNode, the list becomes: list 36 11------- Paste SumNode code below this line Good Luck O

In python. Write a LinkedList class that has recursive implementations of the add and remove methods. It should also have recursive implementations of the contains, insert, and reverse methods. The reverse method should not change the data value each node holds - it must rearrange the order of the nodes in the linked list (by changing the next value each node holds). It should have a recursive method named to_plain_list that takes no parameters (unless they have default arguments) and returns a regular Python list that has the same values (from the data attribute of the Node objects), in the same order, as the current state of the linked list. The head data member of the LinkedList class must be private and have a get method defined (named get_head). It should return the first Node in the list (not the value inside it). As in the iterative LinkedList in the exploration, the data members of the Node class don't have to be private. The reason for that is because Node is a trivial class…