Suppose that a single-CPU system uses round robin scheduling with a time slice of 1 millisecond. The ready queue for this system always contains n processes that make no I/O requests, and the time taken to swap processes assigned to the CPU is negligible. A process (with a burst time of t milliseconds) arrives in the ready queue immediately after a process is assigned to the CPU. This newly arrived process eventually successfully terminates before any of the other processes. How long (in milliseconds) did the process take to execute in this system?