Name: Student number: 4) Linked Lists For the following questions in this section, please refer to the incomplete singly-linked implementation on page 10 of this exam. Problem 1 The following instructions are executed in sequence, starting with the empty list mytist. (4 marks) Draw how the myList looks like at Point A, Point B, Point C, and Point o Here is an example, how to draw a list with 4 elements: LinkedList mylist new LinkedListO mylist.insert(56); // Point A: Your answer here myList.insert (78); // Point B: Your answer here: myList.insert (13); // Point C: Your answer here mylist.insert (64); // Point D: Your answer here: (3 marks) Problem2 Complete the method public boolean contains(int x) of the LinkedList class. It should return true if the element x is in the list, false otherwise. Do not use recursion