A Linked List is printing non-stop until a stack overflow occurs, knowing that there is nothing wrong with the print function or the way it was implemented. You are to investigate and write code to find if the following scenario may be the reason the printing never stops: Note that the actual size of the linked list is not just 4 nodes... its bigger. The dashed arrow indicates there is a lot more nodes in between these two nodes. You are required to write a function that returns true if the above scenario was the root cause of the problem if the list contains a loop. Your function should not exceed the complexity O(n).