Create a program to implement some disk scheduling algorithms. Assume our disk has $400$ tracks numbered $0$ to $399.$ Also assume each request, seek time is one unit of time per track, and $30$ units of time for rotational delay.

Assume we have twenty programs generating requests. After each request for a program has been satisfied, generate a new request according to the following distribution:

$-30\%$ of requests: A random request from $0$ to $399$

$-50\%$ of requests: Repeat the previous request

$-20\%$ of requests: The new request will be the old request $+1$

$-$ If the previous request was for $399,$ then generate a random request.

For SSTF and SCAN algorithms, output how many requests can be satisfied in $100,000$ units of time. You may use either Java or Python for your program.