Java Data Structures Course:

11) Suppose you have the following 2 classes: class Node ( private Node private T Node (T data) Node getNext () void setNext (Node n) { this. next = n; } T getData() next; data; f this.data data; ) f return next; ) return data; ) class OurLinkedList tail; Node find(T target) / you'll write this/) void duplicate (T target) /* you'll write this */ ) Implement OurLinkedList's find method. The method should return the first node in the list whose data is deep-equal to target. Return null if there is no such node. (20 points)