Q$3)40$p

startingNode: $($Sum of All digits of your student id$)$ mod $12$

a$)(5$p$)$ give representation of this graph as an adjacency matrix representation or adjacency list representation.

b$)(5$p$)$ Write the output of graph traversal by Depth First Search startingNode as the source vertex,

c$)(10$p$)$ Using Prim's Algorithm draw Minimum Spanning Tree of above graph

d$)(10$p$)$ Illustrate the execution of Kruskal's Algorithm. Show the final Minimum Spanning Tree.

e$)(10$p$)$ Illustrate the execution of Dijkstra's algorithm using startingNode as the start vertex on the following

graph. Show the priorities before each dequeue operation.