I need help on problems 9-12.

Java

uilding Java Programs 3 x MC Chegg Study I Guided solu x VLMy Drive Google Drive x C https://drive.google.com/drivelmy drive For each of the next four problems, draw a picture of what the given linked nodes would look like after the given code executes, 5. list. list. next a new Li 6. list list next new Link Node list, next 7. list. 1 list new Link Node 4 list next next list, null For each of the next nine problems, you'll see pictures of linked nodes before and after changes. Write the code that will produce the given result by modifying links between the nodes shown and/or creating new nodes as needed. There may be more than one way to write the code. but you may not change any existing node's data field value. If a variable does not appear in the "after" picture. it doesn't matter what value it has after the changes are made. After 9. list. 1 list 1 10. list. list 11. list, 1 --2 list temp 3 4 12. list 1 list. list 1 3 t2 13. list 5 list 4 5 3 14. list list 3 4 5 15. list. list