Problem 1. Write a pseudo code algorithm to perform each of the operations below a through f. Be sure to draw pictures as you work through each algorithm. You cannot work on linked lists without drawing pictures.

: Linear Linked Lists Written Homework be 1. Write a pseudocode algorithm to perform each of the operau h each algorithm. YOL work on pted sure to draw pictures as you work throug linked ists without drawing pictures and the homework will not cannot without showing the pictures! a) Determine the number of nodes in a list. b) Determine the sum of the integers in a list. c) Append a node to the end of a list. d) Concatenate two lists. e) Free all the nodes in a list. ? Delete the last node from a list. 2. Select three methods in the ObjectList class to work through algorithmically. Describe any special cases or boundary conditions that exist for each of the three methods selected. Be sure to draw pictures work through the methods. Remember that you cannot work on linked lists without drawing pictures. The homework will not be accepted without sub the pictures! that might as you 3. Write a Java method with the signature: public ObjectList intersect (ObjectList listl, ObjectList list2) that accepts two unordered linear linked lists and returns a third linear linked list whose nodes contains the intersection of the two original linear linked lists. Note that the intersection of two lists is a new list containing the elements that the two list have in common, without modifying the two original lists. Describe any boundary conditions that might exist. Focus on Data Structures Page