Main Simulation Loop:

The simulation should run in a loop for $720$ minutes.

At each minute:

Check if the next customer has arrived. If they have, enqueue them and schedule the next arrival.If the service is completed, dequeue the next customer and update the service time.Track the maximum number of customers in the queue and the longest waiting time.

$//$Supermarket Simulation

$//$By: Melissa Carpenter

#include

#include

$//$Step $2$: Set Up Time Constants

#define TOTAL$\_$TIME $720$

$//$Step $3$: Create a Queue Structure

typedef struct Customer $\{$

int arrivalTime;

int serviceTime;

struct Customer $*$next;

$\}$ Customer;

$//$Step $4$: Function prototypes

void enqueue$($Customer $**$front$,$ Customer $**$rear$,$ int arrivalTime, int serviceTime$)$;

Customer $*$dequeue$($Customer $**$front$)$;

int main$()\{$

$//$Step $5$: Declare necessary variables

int maxQueueSize $=0$;

int longestWait $=0$;

int currentTime $=0$;

$//$Step $6$: Initialize queue pointers

int arrivalInterval $=$ rand$()\%4+1$;

int serviceTime $=$ rand$()\%4+1$;

$//$Step $7$: Main simulation loop

$//$Step $8$: Print final statistics

printf$("$Max queue size: $\%$d

$",$ maxQueueSize$)$;

printf$("$Longest wait time: $\%$d minutes

$",$ longestWait$)$;

return $0$;

$\}$