assuming that are discus 50 cylinders with an initial request on cylinder 7. The desk receives new request 4-cylinder 1,30,12,26,4 and 6 respectively. Graphically represent the senior using each of the following disk scheduling algorithms (shortest seek first, first come first served, SCANassuming the head moves towards 0​