Consider the following adjacency matrix:

a$)$ Draw the graph. What kind of graph is this? $($directed$/$undirected$,$ weighted$/$unweighted$)?$

b$)$ Does the graph have any cycles? Name one? What is the weight of that path? Is it a simple cycle?

c$)$ What is the shortest path between vertex A and vertex D$?$ What is its weight? d$)$ Perform a breadth first traversal of the graph. Mention clearly the order in which you will visit the nodes and edges.

e$)$ Perform a depth first traversal of the graph. Mention clearly the order in which you will visit the nodes and edges.

f$)$ Convert the adjacency matrix into an adjacency list.