e to determine which suitor she would marry. First, all of the suitors would be lined up on after the other and assigned numbers. The first suitor would be number 1, the second number 2, and so on up to the last suitor number n. starting at the first suitor she would then count three suitors down the line (because eliminated from winning her hand and removed from the line. Eve would then continue, counting three more suitors, and eliminating every third suitor. When of the three letters in her name) and the third suitor would be reached the end of the line she would continue counting from the beginning For example, if there were six suitors then the elimination process would proceed as follows 123456 12456 245 initial list of suitors, start counting from 1 suitor 3 eliminated, continue counting from 4 suitor 6 eliminated, continue counting 1 suitor 4 eliminated, continue from 5 suitor 2 eliminated, continue from 5 125 15 suitor 5 eliminated, 1 is the lucky winner Write a program that creates a circular linked list of nodes to determine which position you should stand in to marry the princess if there are n suitors. Your should simulate the elimination process by deleting the node that corresponds to the suitor that is eliminated for pach step in the process. e to determine which suitor she would marry. First, all of the suitors would be lined up on after the other and assigned numbers. The first suitor would be number 1, the second number 2, and so on up to the last suitor number n. starting at the first suitor she would then count three suitors down the line (because eliminated from winning her hand and removed from the line. Eve would then continue, counting three more suitors, and eliminating every third suitor. When of the three letters in her name) and the third suitor would be reached the end of the line she would continue counting from the beginning For example, if there were six suitors then the elimination process would proceed as follows 123456 12456 245 initial list of suitors, start counting from 1 suitor 3 eliminated, continue counting from 4 suitor 6 eliminated, continue counting 1 suitor 4 eliminated, continue from 5 suitor 2 eliminated, continue from 5 125 15 suitor 5 eliminated, 1 is the lucky winner Write a program that creates a circular linked list of nodes to determine which position you should stand in to marry the princess if there are n suitors. Your should simulate the elimination process by deleting the node that corresponds to the suitor that is eliminated for pach step in the process