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 (i/o) burst. when there is i/o bust we have three variants: shortest remaining burst time first (srbtf)shortest next burst time first (snbtf)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. 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. 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.

5.a fishing rod is formed from a composite material of 0.5 kg of glass fibers embedded in a matrix of 0.5 kg of epoxy resin. the glass fibers are assumed to be long, continuous and unidirectional. to achieve a greater stiffness it is proposed to use a different composite that is comprised of long continuous carbon fibers that will be embedded in a matrix of 0.5 kg of epoxy resin. if the modulus of elasticity of the carbon fiber composite is 10% greater than the elastic modulus of the glass fiber composite, estimate the mass of carbon fibers that will be used to make the carbon fiber composite. assume the applied tensile stress is parallel to the direction of the long axis of the fibers. the epoxy resin, glass fiber, and carbon fiber have an elastic modulus of 5, 86, and 350 gpa respectively and a density of 1100, 2500, and 1800 respectively.