In javascript, write a function that will complete Breadth-First Search on a grid such as below. The function should take in the starting point (sx, sy) and the goal (dx, dy) that must be on the same color and compute the best path to the goal. The search only needs to use up, down, left, right when expanding. Store the nodes in an open and closed list as the search progresses.