This problem is concerned with the so-called Josephus problem (named after the 1st century Jewish historian Flavius Josephus). You can read about it on Wikipedia at http:/I en.wikipedia.org/wiki/Josephus_problem (or just do a search on Wikipedia for Josephus problem). This problem can be simulated using a circularly-linked list that stores the names of the people. Write C++ code to print the name of the survivor, given an external pointer to the last node in the list (which links to the first node) and the integer constant k as described on the Wikipedia page. Use a singly-linked, circular list, without a header node. Hint: use a leading and a trailing pointer. Note that the given external pointer is the initial value for the trailing pointer, and the initial value for the leading pointer can be found by following its link. proi e (Note: this code won't actually tell you where to stand to survive - but it's easy to figure this out in terms of the position of the final survivor relative to the starting position!) (10 points)