a$)$ Traverse this graph beginning at Node $\backslash$#$0$ using BFS$.$

b$)$ Does this graph any cycles? Does this graph have a negative cycle?

c$)$ If you were trying to find the shortest path from Node $\backslash$#$0$ to all the others, which shortest path algorithm would you use and why? What is the shortest path from Node $\backslash$#$0$ to all the other nodes? Begin with the algorithm and show your work.