A grocery store has six separate check-out lanes. Per hour, 50 customers arrive randomly (i.e., CVa=1) at these check- out lanes and pick the queue that they believe is the shortest. Each customer takes about 5 minutes to be served (i.e., scanning & bagging all the items + paying for the groceries), with a standard deviation of 2 minutes. If these six lanes were to be merged, such that there is just one queue and the customer at the head of the queue goes to the first available cash register, then, on average, how many minutes a customer can save?