Develop a program in C++ that will receive the following input from the keyboard:

Total memory size available

Number of processes, the corresponding arrival time (request) and finish time (release) for each process, the size of each process (which should be smaller than the total memory size)

Having these information, assuming all processes are running in a uniprocessor environment, your program should be able to show how the processes are scheduled until completion based on two uniprocessor scheduling namely Shortest Process Next and Round Robin (Q=3). Then your program is required to calculate the turnaround time for each process and the mean of turnaround time and display which of the two algorithm is more efficient. Your program also should be able to show in step by step how much memory will be allocated and remained for each request and release in a Buddy System.