Question $2$

$5$ pts

$2.$ A janitor has a large set of keys which open many different doors in multiple buildings. One strategy for the janitor to avoid wasting time trying multiple keys for every door would be to

color code the keys according to which doors they open.

order the keys by size.

commit all the numbers on the keys to memory. color code the keys according to which doors they open.

create different key rings for each separate building and area.