Assignment, who can help me to solve it?

1- Applying Scheduling Algorithm SJF preemptive and FCFS, Number of processes 5P1,P2,P3,P4,P5, arrival time in order as 0,2,4,5,7 Burst time in ms as 3,4,2,12,8, priority 4, 3, 1, 5, 2 (lowest value highest priority) Contact switch 2ns, find - Awt, - Tat, (total) - compare final results - explain findings. 2- Print in C++ Generalities of all member groups 3- Print in C++or Java one from the above scheduling algorithms . 4- Code a simulator for the SJF preemptive scheduling algorithm. (Not mandatory but will be considered for additional scores)