Assignment #2 1- Given a circularly linked list L containing an even number of nodes, describe how to split L into two circularly linked lists of half the size. 2- Merge two sorted lists of integers to only one sorted singly linked list. Use the given classes in the book 3 Write statements to change a doubly linked list to a doubly circular linked list without sentinels. 4 Write a method in doubly linked list to skip all nodes containing even numbers. You should use the same class of doubly linked as in the book. 5- Use an array of linked lists of friends of each student in the section. Without implementing it in Java, write all needed methods to Add a friend to a student, remove a friend or print all friends of a given student, or find shared friends of two given students. All methods should be implemented and well tested in Java except for last question, you should write in pseudo-language Testing will be considered during the grading process