Write a code that delete all occurrences of a given key in a linked list using the code given that only removes a single instance. (Java) thank you!

public void sortedRemove(Object item) throws NoSuchElementException //find node to specified item SortedNode SortedNode while(curr prevnull: curr-head; !-null && ((comparable) item) . compareTo(curr . ?tem) > e){ prev-curr curr curr.next; if(curr if(prevnull) //if found at head remove head else //remove appropriate node except head numberOfItems-//then decrement list numitems else //throw execption null && ((Comparable)item).compareTo(curr.item) -e) head -head.next; prev.next-curr.next; throw new NoSuchElementException(item "is not found!")