Write the java statements that perform the requested operation on the list shown in F-32. Also draw a picture of the status of the list after each operation is complete. When you delete a node from the list, make sure it will eventually be returned to the system. All insertions into the list should maintain the lists sorted order.

I need to create the linked list that has J, K, M and P in it. Then, I need to design a java method to insert "L" in between "K" and "M".

Assume that prev references the first node and curr references the second node. Insert L into the list.

f-32 is simply an image of the linked list including the letters "J", "K", "M" and "P"

- - - - head FIGURE 5-32 Linked list for Exercise 1 5. There were many types of linked lists discussed in the chapter. What wa in the nodes used in all of these classes? 6. How many assignment operations does the method that you wrote fa Exercise 5 require? Turhandl, where head references