126 views

Answer the question based on the following information.
There are blue vessels with known volumes $v_1 , v_2 ..., v_m$, arranged in ascending order of volume, $v_1 > 0.5$ litre, and $v_m < 1$ litre. Each of these is full of water initially. The water from each of these is emptied into  a minimum number of empty white vessels, each having volume $1$ litre. The water from a blue vessel is not  emptied into a white vessel unless the white vessel has enough empty volume to hold all the water of the  blue vessel. The number of white vessels required to empty all the blue vessels according to the above rules was n.

Let the number of white vessels needed be $n_1$ for the emptying process described above, if the volume of each white vessel is $2$ litres. Among the following values, which is the least upper bound on $n_1$?

1. $\frac{m}{4}$
2. smallest integer greater than or equal to $\frac{n}{2}$
3. $n$
4. greatest integer less than or equal to $\frac{n}{2}$