Solve the above problem and give the answer as soon as possible

Preemtive Priority Scheduling 0 points possible (ungraded) Consider the information of following five processes Process Arrival time Priority Burst time P1 0 5 8 P2 1 0 6 P3 9 4 8 P4 8 2 10 P5 3 3 2. Now, Calculate the following values using Preemtive Priority scheduling algorithm where A higher value represents Higer Priority. Insert the Execution Starting Time of Process P3 (only integer value, no decilam points. For example if your ans is 25.8 or 25.1. insert 25 only) Insert the Execution Ending Time of Process P2 (only integer value, no decilam points. For example if your ans is 25.8 or 25.1, insert 25 only) Insert Avarage Waiting Time (only integer value, no decilam points. For example if your ans is 25.8 or 25.1. insert 25 only) succedures Vux.CSI22 Filca707735875-150mm 12/30/2020 Gustom Fit Eam CSEQ COX BRAC Unity Insert the Number of Context Switches (only integer value, no decilam points For example if your ans is 25.8 or 25.1, insert 25 only) Insert the Throughput of the scheduling algorithm (only integer value, no decilam points For example if your ans is 25.8 or 25.1, insert 25 only) Submit You have used 0 of 2 attempts