In a k server queueing model with renewal arrivals show by counterexam- ple that the condition E[Y] < KE[X], where Y is a service time and X an interarrival time, is not sufficient for a cycle time to be necessarily finite. (Hint: Give an example where the system is never empty after the initial arrival.)