Consider the following situation:

Use this LLNode class for the LinkedList class below.

public class LLNode { public T info; public LLNode next; public LLNode(T info, LLNode next) { this.info = info; this.next = next; } }

Given the generic LinkedList class below, add the specified methods:

public class LinkedList { public LLNode head;

1. Implement contains2Cycle, which returns true if the current linked list contains a 2-cycle and false otherwise. A 2-cycle occurs when two unique nodes link to each other, creating a cycle of length 2.

How many node can there be in a linked list. Can some one draw a graph to show it because I think only 2 is possible.