USE PYTHON !!!!!

USE PYTHON !!!!!

USE PYTHON !!!!!

USE PYTHON !!!!!

USE PYTHON !!!!!

USE PYTHON !!!!!

HAD TO REPOST THIS QUESTION SO PLEASE USE PYTHON !!!!

Complete the following hasCycle function that takes the head of a singly linear linked list as an input and as output to determine if a particular node can be reached again and again. We denote it as a cyclic linked list. If the linked list has a cycle, return True, otherwise, return False. Importantly, no nodes should be constructed in the implementation of the method. Hint: You can take the help of multiple data structures to solve this problem and assume the list will have a maximum of 1000 nodes. Python: def hasCycle(head): \#Write your code here Java: public boolean hasCycle(Node head) \{ // Write your code here