ABC Inc. sells an item to its clients. Due to the paucity of the item, it has decided to

sell $$n$$ numbers of the item at a time to each client in a sequence in every round. For

instance, if n $=2,$ then $2$ items are sold to every client in a sequence in the first

round. Then $2$ more items are sold to every client in the same sequence in the

second round, and so on$.$ This continues till all clients purchase their required

number of items, provided the item is available to the seller. Write a Java program to

implement this problem using a singly circular linked list. Each node contains the

name of the client, its requirement for that item, the remaining item after each

purchase, and the waiting time in days. Please see the example of three clients of

ABC Inc. below: