Write a MATLAB code that implements the BFS algorithm to the figure below. Document the results of traversing the graph starting from each of the six nodes. To do so: Pick any node, visit the adjacent unvisited vertex, mark it as visited, display it$,$ and insert it in a queue. If there are no remaining adjacent vertices left, remove the first vertex from the queue. Repeat step $1$ and step $2$ until the queue is empty or the desired node is found. Do not use bfsearch$()$ please. Make sure that the code works as well.