1. Answer the questions about the graph below.
a. Name one cycle that begins and ends at B.
b. True/False - the graph is strongly connected. If not, explain why not.
c. Find the shortest weighted paths from A to all other vertices. Your answer must include a list of all the vertices in order starting from A in each path and the weight of each path.