The diagram from below shows a grid of $6\times 6$. How many different ways can you get from $A$ to $B$ without going through any of the highlighted points?

The alternatives given are as follows:

$\begin{array}{ll}

1.&\textrm{265 ways}\\

2.&\textrm{365 ways}\\

3.&\textrm{395 ways}\\

4.&\textrm{405 ways}\\

\end{array}$

Does there exist a way to simplify this problem? How exactly can I find the method to solve this? There isn't any indication of which sort of path should be taken. Hence there could be tons of ways and I'm stuck on it. Can someone help me here? It would help a lot to me to **include** some sort of diagram or **drawing to justify** a reasonable method to solve this.