Consider two processes $P_1$ and $P_2$ each of which needs exactly one CPU burst. The duration of the CPU bursts are 10 ms and 20 ms for $P_1$ and $P_2$ respectively. Assume that the processes are scheduled using a round-robin scheme with a time-slice of $t$ ms, a context switch takes 5ms, and it takes negligible time to run the scheduling algorithm. If $P_1$ and $P_2$ are equally likely to get the first time-slice, calculate the value of $t$ so that the average turnaround time for $P_1$ and $P_2$ is minimized.