please help with this comp arch assignment

here is the code

so I must implement 11_cycle.c with the completed 11_has_cycle() function. what is the correct code for this? please help and explain. thank you

Exercise 5: Pointers and Structures in C The following is helpful for your interviews as well. In 11_cycle.c, complete the function 11 has_cycle () to implement the following algorithm for checking if a singly-linked list has a cycle. 1. Start with two pointers at the head of the list. We'll call the first one tortoise and the second one hare. 2. Advance hare by two nodes. If this is not possible because of a null pointer, we have found the end of the list, and therefore the list is acyclic. 3. Advance tortoise by one node. (A null pointer check is unnecessary. Why?) After you have correctly implemented 11_has_cycle (), the program you get when you compile 11_ cycle.c will tell you that 11 has_cycle() agrees with what the program expected it to output Hint: There arle two common ways that students usually write this function. They differ in how they choose to encode the stopping criteria. If you do it one way, you'll have to account for a special case in the beginning. If you do it another way, you'll have some extra NULL checks, which is OK. The previous 2 sentences are meant to urge you to not stress over cleanliness. If they don't help you, just ignore them. The point of this exercise is to make sure you know how to use pointers. #include typedef struct node f int value; struct node next; ) node; { *head) /* your code here */ int 11-has-cycle(node void test 11 has cycle(void)t int i node nodes[25]: /Henough to run our tests for(1 e i i