implement the Round Robin scheduling algorithm using C++. The user should enter a number of processes, their arrival times and their burst times. Data entry can be through console or graphical interfaces or embedded in the program. Your program should find, select and display the order in which the processes are executed (it will be nice if you can draw the Gantt chart) and the start and end of each execution cycle (you can add the length of the execution cycle). At the end, calculate the average waiting time of all the processes and display it.

*****note: please pay attention to each detail and make sure to implement it, please write a function to draw the gantt chart.

*** please write the program as simple as you can