There is a bank, containing ‘c’ counters. There are ‘n’ people standing in a queue. The counters open at 9:00 A.M. There is also an array a[n] given, containing the time taken by every person to coomplete his/her query at the counter. Whenever one counter gets empty, the very next person in the queue goes to that particular empty counter. Find at what time the x’th person (x <= n) will have his/her turn and at which counter. A fully working code was expected, considering all the base cases and exceptions, with proper syntax. (Written Code)