2. (15 pts) Implement the Josephus Problem, whose description can be found in note3-LinkedList-Stack-Queue.pptx (referred to as note3 here- after). Note that some online descriptions of this problem can be dif- ferent from our note. Use our note as the reference. The requirements are: (a) The program pops a message: "Please input n: ". Then the program reads n from the keyboard input.(b) The program pops the second message: "Please input k: ". The program reads k from the keyboard input. (c) The program must use the struct node defined in note3 to con- struct the linked list for items 1 to n (not 0 to n-1). 1 to n are saved as info in each node in the linked list. (d) Implement the Josephus problem (e) Output the last node left, e.g. "The last node is 5". (f) In this problem, you cannot use any previously defined class about linked list. Use similar operations on pages 11 to 16 of note3. Grading. We will test your program using different n and k. Correct implementation following all the requirements: 15 points. 0 if the program fails to compile. Partial credit (up to 7) if the results are partially correct or follow part of the requirements