In C++

Problem 3 (25 points) Given a circular linked list, implement an algorithm that returns the node at the beginning of the loop. node, so as to make a loop in the linked list Example Input: A->B->C_ > D->E->C[the same C as earlier] Output: Remark. Y ou may not copy the elements into any other data structure