In the analysis of the deterministic selection algorithm discussed in class, we proved the following upper bound: | L | ceiling(7n/10) + 3. But we did not claim that this was a tight bound. For n = 25, give a tight upper bound on the size of L. In other words, find the value k such that both of the following conditions hold:

|L| will always be k when n = 25, and

there is a set S of 25 elements for which L does indeed contain k elements.

Justify your answer.