60 customers per hour arrive randomly (i. e., cva = 1) and randomly join one of 6 unpooled queues. each of the six employees can handle exactly 15 customer requests per hour (i. e., no variability). how many minutes of waiting time can be saved by pooling of all six queues into one queue?

the data of the detroit pistons in numerical order from least to greatest is 0.30, 0.37, 0.55, 0.62, 0.69, 0.72, 0.73, 0.75, 0.77, 0.78, 0.80, 0.81, 0.81, 0.83, 0.84, 0.89

the data of the miami heat in numerical order from least to greatest is 0.50, 0.50, 0.56, 0.57, 0.67, 0.72, 0.72, 0.72, 0.75, 0.75, 0.76, 0.81, 0.82, 0.90, 1.00, 1.00

the detroit pistons median : 1.52

the miami heat median: 1.47

the iqr of this data is 0.05

i dont understand the question? ?

step-by-step explanation: