Consider the LSH example shown in class with $4$ lines to separate points into bins.

Suppose we are searching for the nearest neighbor for a point $($#awesome$=3,$ #awful$=1)($this point will end up in bin $[110].$

As discussed in class, there are many ways to make LSH less likely to fail such as searching nearby bins as long as that isn't computationally inefficient. Suppose we decided that we will also search the two bins adjacent to the target bin.

Which bins will we search for this target point's nearest neighbor? Select all that apply.