give it quickly

Q5: (a)Make an adjacency matrix for the given weighted graph. 3 1 2 15 13 9 (b) For the Given graph a Apply Depth first search algorithm to find a path from node 6 to node 9. b. Apply Breadth first search algorithm to find a path from node 6 to node 9. Note: While pushing nodes into stack or enqueing nodes into queue, push or enqueue minimum element first. C o ou lo