Consider a process with a single CPU burst of 100 time units and a single disk I/O of 1000 time units at the end. If the timer interval is fifteen time units and the process scheduling algorithm is round-robin, at most how many times would the process enter the ready queue before entering the terminated state? Assume that there is a sufficiently large number of processes of similar nature trying to run on the CPU