Given the following tracks that are in the queue, which disk scheduling algorithm would most efficiently retrieve the data from a disk with 200 tracks? 86, 172, 28, 132, 13, 150, 55, 60, 20, 180 – last data retrieved was on track 40.

what doesn’t the above problem account for?

Write a program that inserts the digits of an integer into an array in originalorderfollowed by reverse order. first, promptthe user to enter a positive integer(> 0). determine the number of digits of the integer. create a dynamically allocated integer arrayof a size twice the number of digits.now insert the digits in original order which will occupy half of the array. then, insert the digits in reverse order.finally, output thedigits in thearray.use at least two functions to organize your program.