PLEASE ANSWER WITHIN 20minit

1. Consider the following weighted graph: 4 2 12 15 11 18 3 5 4 5 a) b) c) d) e) What is the size of the graph? Find the adjacency matrix of the graph (using weight value). List the vertices of the graph in depth first traversal (Origin node is node '1'). List the vertices of the graph in breadth first traversal (Origin node is node '1'). Show the steps to find the vertices of the graph in a breadth first topological ordering. Find a shortest path from the vertex 1 to vertex 5 by representing the graph that having 3 fields: vertex label, edge weight sum and predecessor, f)