You are given the start node of a singly linked list of size n. However, it might be corrupted, such that if you follow the pointers in the list to the next node, you might end up in a loop. You can only store a constant number of node pointers. How do you:

a. Determine if the linked list is in a loop in linear time.

b. Determine the first node of the loop in linear time.