Implement a (NON-RECURSIVE) method to delete ALL occurrences of an item from a circular linked list. Your method should return a reference to the last node of the resulting list. public class Node {public T data; public Node next; public Node(T data, Node next) {this.data = data; this.next = next;}}//Deletes all occurrences of item from a circular linked list (last node//pointed to by rear), without using recursion//Returns the rear of the resulting linked list//If the item is not in the list, throws a NoSuchElementException public static Node deleteAll(T item, Node rear) throws NoSuchElementException {//COMPLETE THIS METHOD