In the videos we show that shortest job first is the best algorithm with respect to average turn around time when there is no input output (1/0) burst. when there is 1/0 bust we have three variants: a) shortest remaining burst time first (srbtf) b) shortest next burst time first (snbtf) c) shortest total burst time first (stbtf) does srbtf have the least average turnaround time? if yes prove it in explanation, if no give an example schedule which is not srbtf but has lower turnaround time. (2 for y/n 4 for explanation) does snbtf have the least average turnaround time? if yes prove it in explanation, if no give an example schedule which is not snbtf but has lower turnaround time. (2 for y/n 4 for explanation) does stbtf have the least average turnaround time? if yes prove it in explanation, if no give an example schedule which is not stbtf but has lower turnaround time. (2 for y/n 4 for explanation)