. Objectives To simulate First Come First Served (FCFS) scheduling algorithm using C/C++ To simulate Priority Scheduling algorithm using C/C++ 2. Procedures 1) Simulate First Come First Served (FCFS) Scheduling Algorithm a. In this part of the program, you will: Prompt the user to enter the number of processes (limit to 5) Prompt the user to enter the burst time for each process Calculate waiting time for each process Calculate turnaround time for each process Calculate average waiting time and turnaround time for all the processes Display all the information similar to the sample output window below 3) Simulate Priority Scheduling Algorithm a. In this part of the program, you will (just modify your last program): Prompt the user to enter the number of processes (limit to 5) Prompt the user to enter the burst time and priority number for each process (1 is the highest) Sort the processes in ascending order according to their priorities. Calculate waiting time for each process based on the priority list Calculate turnaround time for each process based on the priority list Calculate average waiting time and turnaround time for all the processes Display all the information similar to the sample output window below You can simply use arrays for the processes, priority, process number, wait time and turnaround time in the program. You can also pointers and structure, etc. Please i need the code so i can run. tHANKS