$5.[24$pts$]$ consider the following graph

$($a$).[5$pts$]$ what is the result of the breadth$-$first search? $($ no need to show,just list the final result$)$

$($a$).[5$pts$]$ what is the result of the depth$-$first search? $($ no need to show, just list the final result$)$

$($c$).[14$pts$]$ use Dijksstra$$s algorithm to find the shortest path from source node $1$ to all other nodes in the graph. Need to show the work$/$table step by steps as we did in the class and then fill in the table on page $5$ based on your work accordingly.