CPU burts of three processes A, B, and C are shown below: Process A Process B Process C 10 14 18 24 30 36 39 41 47 a) (3 points): Find the predicted processing time for the next CPU burst of all processes (A, B, and C) in shortest process next (SPN) scheduling policy with simple averaging. b) (3 points): Find the predicted processing time for the next CPU burst of all processes (A, B, and C) in shortest process next (SPN) scheduling policy with exponential averaging (with a = 0.8 and 0 = 0). c) (3 points): Find the predicted processing time for the next CPU burst of all processes (A, B, and C) in shortest process next (SPN) scheduling policy with exponential averaging (with a = 0.5 and to = 0). d) (3 points): Find the predicted processing time for the next CPU burst of all processes (A, B, and C) in shortest process next (SPN) scheduling policy with exponential averaging (with a = 0.2 and T = 0). d) (8 points): What processes are selected in parts (a) to (d)? Comment upon the part "history of execuation" of that process has played in its final selection (long-term, short-term, or medium-term).