Given the following three jobs $($processes$),$ determine the time when P$2$ finishes assuming round$-$robin scheduling with a quantum of $10$CPU units.

$\backslash$table$[[$Process$,$Arrival Time,CPU Burst time,Priority$],[$P$1,5,10,2],[$P$2,15,5,1],[$P$3,0,20,3]]$

$20$

$25$

$35$

$10$

$5$

$0$