Parts arrive at a machine shop with EXPO(25) interarrival times (all times are in minutes); the f rst part arrives at time zero. The shop has two machines, and arriving parts are assigned to one of the machines by f ipping a (fair) coin. Except for the processing times, both machines operate in the same fashion. When a part enters a machine area, it requires operator attention to set up the part on the machine (there is only one operator in the shop). After the part is set up, the machine can process it without the operator. Upon completion of the processing, the operator is once again required to remove the part. After completion, the parts exit the system (parts have to go to only one machine). The same operator does all setups and part removals, with priority given to the machine waiting the longest for an operator. The times are (parameters are for triangular distributions): Machine Number Setup Time Process Time Removal Time 1 8, 11, 16 20, 23, 26 7, 9, 12 2 5, 8, 14 11, 15, 20 4, 6, 8 The run length is 25,000 minutes, and any parts present at that time are simply abandoned; make just a single replication. Observe statistics on machine utilization, operator utilization, cycle times for parts separated by which machine they used, overall cycle times (that is, not separated by machine used), and the time that each machine spends waiting for operator attention (both at setup and removal); put a text box in your model with values on these output metrics. Animate the process using storages for the setup, process, and removal activities.