A carwash shop has two stations: cars get washed at station 1 and then proceed for detailing at station 2. Each station processes one car at-a-time and has a FIFO queue. Suppose that the first car arrives at the shop at time zero and the next 5 cars arrive with the following interarrival times (in minutes): 7.2 0.7 0.1 0.7 1.0 The corresponding service times for these 6 cars at station 1 are: 2.8 8.4 0.5 1.9 0.4 2.3 The service times at station 2 are i.i.d. discrete random variables taking values 4, 6 or 8 minutes with respective probabilities 0.50, 0.25 and 0.25. Use the following random numbers to determine the service times for the 6 cars: 0.49 0.24 0.72 0.13 0.44 0.08 Then create a table similar to the one we used to simulate a single-server queue with Excel. Each row should simulate a single entity (car) as it goes through the system. (a) When does the 6th car complete service at the shop?