Round-robin scheduler with tasks arriving over time

Simulate a deterministic single-CPU round-robin scheduler with a fixed time quantum. You get tasks as a list of [name, arrival, burst] (integers, arrival non-decreasing in input order) and an integer quantum. At each step the CPU runs the front task for min(quantum, remaining) ticks; if it still has work it goes to the BACK of the ready queue, but any tasks that ARRIVED during those ticks (arrival <= current_time after running) are enqueued BEFORE the preempted task is re-added. Ties in arrival keep input order. Return the list of task names in the order they COMPLETE.