Help me solve the following Dijkstra Algorithm problem

all slide references are in this presentation. Two graphs are provided below in matrix form. For each graph draw

the graph representation as shown in slide $15/16$ of the presentation above and indicate the shortest path and

total cost from the start node to all other nodes. The start node for the first graph is $[1]$ and for the second graph

it is $[4].$ Your answers must have the following format:

A$.$ Graph representation $($diagram of graph as on slide $15/16).$

B$.$ Dijkstra on the graph $($table as shown in slide $15/16).$ This section should have the table $($Step$,$ N$",$ D$($x$),$p$($x$)$ etc$)$

with the steps of your Dijkstra application to the graph as shown in slide $15/16.$

C$.$ Shortest paths each node, for example, to node $3$: $1-4-5-3-$ Cost $=3$

How to interpret the matrix form below? The first line indicates the number of nodes, e$.$g$.6$ nodes in the first

graph, and each node is numbered as $1,2,$dots$6.$ Each cell indicates the cost from the $[$row$]$ to the $[$column$],$ e$.$g$.$ in

the first graph $[1]-[2]=3$ and $[2]-[3]=4.$ The cost from a node to itself is zero. Zero in any other cell, eg $[1]-[5],$

means there is no direct path from $[1]$ to $[5].$

$6$

$037200$

$304100$

$740526$

$215030$

$002304$

$006040$

$8$

$02510034$

$20320045$

$53031526$

$12301067$

$00110218$

$00502079$

$342617010$

$456789100$

Containing your answers for the Dijkstra algorithm on both graphs, formatted as in slide $26,$ the

completed table $($without the red arrows.$)$ Your graphs must be drawn clearly $($and digitally, no hand drawings$).$

There is no minimum page requirement; Your PDF document should include answers for the Dijkstra algorithm

on both graphs, formatted as in slide $26,$ the completed table $($without the red arrows.$)$ Your graphs must be

drawn clearly $($and digitally, no hand drawings$).$