Write a program called$$hddSched$.$cpp$$that simulates the working of different disk scheduling algorithms, such as:

First$-$Come, First$-$Served $($FCFS$)$Shortest Seek Time First $($SSTF$)$SCAN $($Elevator Algorithm$)$C$-$SCAN $($Circular SCAN$)$

The program should take as input a list of disk requests $($in terms of cylinder numbers$)$ and the initial position of the disk head.

Calculate and display the total seek time $($total head movement$)$ for each algorithm.

Compare and print the performance of each algorithm based on seek time for a given set of input requests.