An undirected graph as below: a$.$ Write the adjacency matrix of the above graph.

b$.$Apply BFS and DFS on the above graph$($the order of the $($The order of accessing adjacent vertices

should be from the smallest vertex number to the largest one; otherwise, the score will be $0.$ :

Start from vertex $1$

BFS:

DFS:

A dicted graph as below. Find the shortest path from V$0$ to the others using Dijkstra algorithm. Fill the

blanks to complete the process of the algorithm.

Fill in the blanks where solid lines are drawn in the table.

The last line : $\frac{C}{1}$ indicates that the shortest path from $A$ to $C$ has been found, and the length is $1.$ And modify

the Dist of this vertex to be $\text{'}$#$\text{'}.$