Stacks of paper arrive at a trimming process with interarrival times of EXPO(10); all times are in minutes and the f rst stack arrives at time 0. There are two trimmers, a primary and a secondary. All arrivals are sent to the primary trimmer. If the queue in front of the primary trimmer is shorter than f ve, the stack of paper enters that queue to wait to be trimmed by the primary trimmer, an operation of duration TRIA(9, 12, 15). If there are already f ve stacks in the primary queue, the stack is balked to the secondary trimmer (which has an inf nite queue capacity) for trimming, of duration TRIA(17, 19, 22). After the primary trimmer has trimmed 25 stacks, it must be shut down for cleaning, which lasts EXPO(30). During this time, the stacks in the queue for the primary trimmer wait for it to become available. Animate and run your simulation for a single replication of 5,000 minutes. Collect statistics, by trimmer, for cycle time, resource utilization, number in queue, and time in queue. Put a text box in your Arena f le with, separately for each of the two trimmers, the average time in system (a.k.a. cycle time) for stacks of paper that go through that trimmer, the resource utilization, the time-average number of stacks in that queue, and the average time of stacks in that queue.