data structures using try the same process with and = you will find that person at position is the winner the elimination goes in the sequence of and programming example write program which finds the solution of josephus problem using circular linked list #include #include #include struct node int player_idstruct node *next}struct node *start*ptr*new_nodeint main(int nkicountclrscr()printf("\ enter the number of players ")scanf("% "& )printf("\ enter the value of (every kth player gets eliminated)")scanf("% "& )/create circular linked list containing all the players start malloc(sizeof(struct node))start->player_id ptr startfor ( <ni++new_node malloc(sizeof(struct node))ptr->next new_nodenew_node->player_id inew_node->next=startptr=new_nodefor (count ncount count--for ( ++iptr ptr->nextptr->next ptr->next->next/remove the eliminated player from the circular linked list printf("\ the winner is player % "ptr->player_id)getche()return output enter the number of players enter the value of (every kth player gets eliminated) the winner is player