Setup: You need to generate D elements and insert them into an "element" queue. Each element has two properties:Arrival time $($based on exponential inter$-$arrival time distribution, added to the previous elements arrivalOnce youve established all arrival and service times, you need to run a simulation experiment where you process each element in the queue and determine the next event:Arrival, wait in queue $($if server is busy$)$Arrival$,$ start service $($if server is free$)$End service for current customer being served $($departure$),$ start service for next in line $($if queue has at least one customer$)$End service for current customer being served $($departure$),$ and wait for next arrival $($if queue has zero customers$)$ During the simulation, you should keep track of current time, and advance it to the time of the next event $($arrival or departure$).$ You should keep track of elements in the queue at current time, so you can have two pointers that point to "first element in queue at current time" and "last element in queue at current time". The next event would be either the departure of the first element or an arrival for the element beyond the current last element.$//$ Function to run the simulationvoid Simulation$($struct Queue $*$elementQ$,$ double lambda, double mu$,$ int print$\_$period, int total$\_$departures$)\{\}$