[In JAVA ] Given a singly linked list, Your task is to remove every K-th node of the linked list. e.g. k=2

1->2->3->4->5->6 start counting from 1. 1->2->4->5->6 delete 3; continue counting from 4.

1->2->4->5 delete 6; continue counting from 1.

1->2->5 delete 4; continue counting from 5.

1->5 delete 2; continue counting from 5. 1 delete 5 eliminated; 1 is the output.