Bad Qubits — Learn Quantum by Doing

Multiple choice

In Simon's algorithm on n = 3 bits, measurements give the strings y = 010 and y = 111. The hidden string s ≠ 000 satisfies y·s = 0 (mod 2, bitwise) for every sample. Which value of s (as an integer) is the unique nonzero solution?

2 (binary 010)
5 (binary 101)
7 (binary 111)
1 (binary 001)