The arrival time, burst time and priorities of five processes are given as:
$\begin{array}{|c|c|c|c|} \hline \text{Process} & \text{Arrival Time} & \text{Burst time} & \text{Priority} \\ {} & {} & \text{(in minutes)} & {} \\ \hline P & 0 & 2 & 3 \\ \hline Q & 0 & 4 & 5 \\ \hline R & 0 & 6 & 2 \\ \hline S & 0 & 8 & 1 \text{(highest priority)} \\ \hline T & 0 & 10 & 4 \\ \hline \end{array}$
For the priority scheduling algorithm the average response time is ________ minutes . Ignore the context switching overhead.