Can someone walk me through how to do each method. The hint in the first stanza is telling me to use a set to keep track of the nodes. All of this is using Java

Problem 1: LinkedList Util.java Using the LLNode java class I provide, write the following methods public static boolean hasCycle(LLNode head Returns true if the linked list starting at head has a cycle (i.e. its tail points to another node in the list instead of nul Hint: There's a data structure very good at saying "hey, have you seen this?" public static LL.Node concat (LLNode head1, LLNode head2) Concatenate the list starting at head2 to the tail of the list starting at headl and return headl Le. if headl is a->b>e and head 2 is xy>z You should return the list public static LL.Node toLinkedL.ist(ListString arr) Convert the list into a Linked List. If arr is empty, return null. public class LLNodef public String value; public LLNode next; public LLNode (String value, LLNode next) { this.value = value; this.next - next; public String toString () ( value; next.toString ); if (next--null) return return value"" +