Modify the solution to the Josephus Problem (Example 7.6 on page 140) so that it also uses a SKIP parameter to generate the output. The value of SKIP is a constant nonnegative integer that specifies whom each soldier should kill. For example, if skip = 2, then A would kill D (skipping over B and C), E would kill H, and so forth. The original solution is then the special case where skip = 0. Assume that no one commits suicide. So if a killers target turns out to be himself, he would kill the next man in the list.