Please help me with this question. I would really appreciate it.

Consider a singly linked list, containing a first, last and length field. a Complete the java method for this class so that it removes all elements that contain a data field equal to a target value. b) Analyze the worst-case time complexity of your solution using big O notation. Make your bounds as tight as possible. Also provide justification for your answer class LinkedList ( private Node first; private Node last; private int length; private static class Node [ public T data; public Node next; public Node(T value) [ data = value; /ext by default is nul For example, consider list of integers that looks like this prior to method invocation with a target equal to 3: data data 42 data 17 data data 2 first last next next null next next next After the method completes, it would look like this: data 2 data 42 data 17 first last / next -t r next r next null length 3