Write a program in C++ to simulate First Come First Served scheduling policy by using dynamic queue. The queue contains the processes. Process has the attributes ProcessID, ExecutionTime, WaitingTime and TurnAroundTime. The user will enter only execution time while creating a new process. Finally print Gant chart showing all the processes with ProcesID, ExecutionTime, Waiting Time and TurnAroundTime and at the bottom of table show the average WaitingTime and average turn around time.