pls solve quickly

Assume that we would like to simulate a simple processing system by hand-simulation. "Blank" parts arrive at a drilling center, are processed by a single drill press, and then leave. If a part arrives and finds the drill press idle, it's processing at the drill press starts right away; otherwise, it waits in a First-In First-Out (FIFO) queue. This is the logical structure of the model. The model is initialized, with all variables and accumulators set to 0 , the queue empty, the drill press idle, and the event calendar primed with the first arrival happening at time 0.00 and the end of the simulation scheduled for time 20.00 . The record of the hand simulation at simulation time 3.79 is given in the table below. Event calendar at simulation time 3.79 is given in the table below. You are to fill in the information below for the next event in the event calendar. Q(t)=B(t)= Arr. Times (in Queue):( k Arr. Times, in Service P=N=WQ= TS=Q=BB=