Hi All,
This is a poorly-worded question, so you might want to consider studying with practice materials that are better "designed'.' That having been said, the 'intent' of this question is probably that there are 5 locks and 5 keys - and each of the keys opens exactly one of the 5 locks. We're asked for the least/most number of attempts that it would take to determine the proper 'pairing' of each key to each lock.
To start, you should notice that the answer choices are all relatively small, so you can probably 'brute force' the solution - just 'map out' how the attempts would have to go (without need of any complex math).
Let's call the locks: A, B, C, D and E
Let's call the (matching) keys: a, b, c, d and e
IF.... we 'luck out' and manage to place each key with each lock on the first try, there would be...
a in A = 1st attempt
b in B = 2nd attempt
c in C = 3rd attempt
d in D = 4th attempt
Based on what we're told, with just one lock and one key left, there'd be no reason to make an attempt - that key would have to fit that lock. Thus, the LEAST number of attempts would be 4. Eliminate Answers A, C and E.
In that same way, we can now determine what would happen if we were 'unlucky' and took the maximum number of tries to open each lock.....
a in B/C/D/E = 4 attempts... and then we'd know that a would have to 'match' A.
b in C/D/E = 3 attempts... and then we'd know that b would have 'match' B.
c in D/E = 2 attempts... and then we'd know that c would have to 'match' C.
d in E = 1 attempt... and then we'd know that d would have to 'match' D.
That would leave just e in just E, which would not require an additional attempt.
Thus, the MOST number of attempts would be 10.
Final Answer:
GMAT assassins aren't born, they're made,
Rich