Five batch jobs, A through E$,$ arrive at a computer at essentially the same time and end up ordered alphabetically from the front in the ready queue. They have an estimated running time of $11,7,5,9$ and $13$ minutes, respectively. Their externally defined priorities are $2,3,1,4$ and $5,$ respectively, with a lower value corresponding to a higher priority. For each of the following scheduling algorithms, determine the process schedule and the average turnaround time $($TAT$).$ Hint: First you should determine the TAT of each job and then you can determine the average TAT. Ignore the dispatcher and the process switching overhead. Assume that all jobs are completely processor bound. Include the calculation steps in your answers. $2\mathrm{.}1$ Round Robin with a time quantum of $3$ minutes $(2)2\mathrm{.}2$ Priority Scheduling $(2)2\mathrm{.}3$ Highest Response Ratio Next