Suppose that four processes arrive for execution in a computer system P1, P2, P3 and P4 (in that order), with arrival time t0 = 0 and time requirements 3, 6, 10 and 8 time units respectively. If we use Round Robin scheduling algorithm (RR) with time quantum 2 and consider the switching time between processes (context switch), P4 will complete its execution at the time: a) 23 b) 24 c) 25 d) 26