In Java and include comments

Refer to Chapter 12 LList. Adding nodes to or removing nodes from a linked chain requires a special case when the operation is at the beginning of the chain. To eliminate this special case, you can add a dummy node at the beginning of the chain. the dummy node is always present but does not contain a list entry. The chain then is never empty and so the head reference is never null, even when the list is empty. Modify the class LList as presented in that chapter, by adding the dummy node to the chain. Test your implementation. Testing and Submitting At the end of your source program include the output from your program during your testing, as comment. If your program does not run and gives you any kind of error, include that message. Refer to Chapter 12 LList. Adding nodes to or removing nodes from a linked chain requires a special case when the operation is at the beginning of the chain. To eliminate this special case, you can add a dummy node at the beginning of the chain. the dummy node is always present but does not contain a list entry. The chain then is never empty and so the head reference is never null, even when the list is empty. Modify the class LList as presented in that chapter, by adding the dummy node to the chain. Test your implementation. Testing and Submitting At the end of your source program include the output from your program during your testing, as comment. If your program does not run and gives you any kind of error, include that message