need a help for this question about the operating system.

Five batch jobs, A through E, arrive in alphabetical order at a computer at almost the same time (.e. they all arrive before the next scheduling event occurs). They have estimated running times of 79, 92, 99, 71, and 92 ms, respectively. Using diagrams, show how the process scheduling algorithms below would schedule these jobs (if multiple processes could be selected at any stage by the algorithm, it MUST select the one that comes first alphabetically), and calculate the mean process turnaround time (assuming no process switching overhead): 1. SPN 2. HRRN 3. Feedback scheduling with five queues (1-highest priority, 5 lowest priority), witlh lowest priority), queue k having a quantum of 2 ms