Q$2.$ Given the following graph, $($a$)$ Write the adjacency matrix of the graph. $($b$)$ Find the MST of this graph using Kruskal$$s algorithm, show your steps $($c$)$ Find the MST of this graph using Primm$$s algorithm, show your steps. $($d$)$ Find the shortest path from a to I, show your steps. $($e$)$ Show DFS and BFS traversal of the graph, starting at node a$,$ show your steps.