Graph$-$Elementary Algorithms $(30$pts$)$

Given a graph $G$ represented by the following list of successors.

For each pair $(x,y),x$ is the weight of the edge, $y$ is the terminal extremity of the edge.

$3.$a$.$ Draw the graph $(10$pts$)$

$3.$b$.$ Show an adjacency matrix of the graph $(10$pts$)$

$3.$c$.$ Topological sort the graph $G$ from node $A,$ and write a topological order of all nodes

$(10$pts$)$