Current system. A DMV office currently has $3$ clerks assisting customers to obtain license plates for their cars. Each clerk services only customers from one particular geographic region. Customers arrive and enter one of three lines based on their area of residence. You may assume that customers are distributed equally across the three regions. Each customer type is assigned a single separate clerk to process the application forms and accept payment with a separate queue for each. Service times are uniformly distributed anchored at $(8,10)$ minutes for all customer types. After completion of this phase all customers are sent to a single supervisor who reviews the application paperwork and issues the plates. Thus all $3$ customer types merge into a single FIFO queue for this phase. Service time for this activity is uniform $(2\mathrm{.}66,3\mathrm{.}33)$ minutes. Output MOEs: the average and max time in system for all customer types combined.

A$)$ Model this arrival activity as three independent arrival streams. For each stream, customer interarrival times are exponentially distributed with mean $10$ minutes. $($Begin each stream with an arrival at time $00$:$00.)$ Develop a model of this current system and run for $5,000$ minutes. You may consider first $500$ min as a warm$-$up period. Animate your model.

B$)$ Run A with $5$ replications.

c$)$ Show the results graphically for single replication and for $5$ reps.