ID a. Explain whether starvation is possible with the shortest Seek Time First algorithm used in hard drive access. b. A nonpipelined system takes 300ns to process a task. The same task can be processed in a 4-segment pipeline with a clock cycle of 50ns. Determine the speedup ratio of the pipeline for 1000 tasks. What in the maximum speedup that could be achieved with the pipeline unit over the nonpipelined unit