i just need the answer, no work

Given the three processes and the respective arrival times, and total CPU times shown in the table below, using the SRT algorithm, what is the end time for p1 ? 5 16 Three periodic processes with the following characteristics are to be scheduled. The CPU utilization is: Does a feasible schedule exist? \begin{tabular}{c} 0.8, No \\ \hline 0.8, Yes \\ \hline 1.0, Yes \\ 1.0, No \end{tabular} Processes p1 and p2 execute on a system with a single CPU and 2 identical I/O devices. Each process executes a compute-bound phase followed by an I/O-bound phase. The following table shows the lengths of each phase. p1 starts first at time 0. Without multiprogramming, the computation terminates at time: \begin{tabular}{c} 120 \\ \hline 60 \\ \hline 130 \\ \hline 90 \end{tabular}