In an ancient land, the beautiful princess Eve had many suitors. She decided on the following procedure to determine which suitor she would marry. First, all of the suitors would be lined up one 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 of the three letters in her name) and the third suitor would be eliminated from winning her hand and removed from the line. Eve would then continue, counting three more suitors, and eliminating every third suitor. When she reached the end of the line she would continue counting from the beginning. For example, if there were 6 suitors then the elimination process would proceed as follows: Suitors: 1 2 3 4 5 6 Suitor 3 will be eliminated! Suitor 6 will be eliminated! Suitor 4 will be eliminated! Suitor 2 will be eliminated! Suitor 5 will be eliminated! To win the princess, stand in position 1. Complete the function selectSuitor(), member of the DoublyList class, to determine in which position a suitor should stand to marry the princess if there are n suitors. A few more details: • The doubly-linked list has each node numbered, starting from the first node as 1, the second at 2, and so on, up to the last node which stores the position of the last suitor. • The easiest way to go around the list is by connecting the first and last node to make this a "circular" list. • Keep traversing the list and deleting every third node until you get to a single node, which holds the position of the winning suitor. • Every time you delete the third node, print the message, "Suitor # will be eliminated!" where # is the suitor's position. • Once you are left with one node, make sure all member variables and pointers in the remaining nodes are updated. Restriction: You may not create any containers (no array, no vector, no linked lists, etc.). All the work must be done in the linked list. The body of the function should be around 20 lines (excluding blank lines, curly brackets, and comments). If your code gets too long, you should revisit it and make it more efficient. Tips on efficiency/readability: • You only need 2 pointers and 2 nested loops. • The body of the function should be around 20 lines (excluding blank lines, curly brackets, and comments). If your code gets too long, you should revisit it and make it more efficient. • Choose descriptive identifiers (do NOT use "curr", or "ptr", or a single letter, except for "i"). To easily debug your code, you should work on Visual Studio. Use the files available in the doubly-linked list chapter and create a list that stores integers from 1 to n (the number of suitors). Once it is working, you can paste your code in CodeCheck.