C++ code to implement a global function of Josephus circle problem
a global function to implement Josephus circle problem as discussed in class. This function takes two integer parameters named Length of circle (l) and Count to choose next (k) and returns the Last person left standing or Josephus Position using a circular linked list.
int JosephusPosition(int l,int k)