Write a function that takes $($x$,$ y$)$ coordinates for the locations in a TSP and solves it using nearest neighbor algorithm.

The function should take a list named x$\_$y$\_$coordinates whose elements are lists of x and y coordinates of each node.

Consider three nodes having the following $($x$,$ y$)$ coordinates: $(1,3),(6,2),(9,5).$ The coordinates list would look like this:

$[[1,3],[6,2],[9,5]]$

Your code should return the visiting sequence of the solution as a list as depicted below.