n robots are moving with speed $1$ and are all starting at the center of a unit disk at the same time. They are searching for an exit placed at an unknown location on the perimeter of the disk. They do not know where the exit is but can recognize it when they are co$-$located with it$.$ In the wireless model there is an algorithm

Question $6$ options:

so that all robots know the exit has been found in time at most $1+2\backslash$pi$/$n

so that all robots know the exit has been found in time at most $1+\backslash$pi$/$n

so that all robots know the exit has been found in time at most $1/2+2\backslash$pi$/$n

so that all robots know the exit has been found in time at most $1+\backslash$pi$/2$n

so that all robots know the exit has been found in time at most $1+\backslash$pi$/3$n