Can you solve this question $?$ Consider the following network with labeled nodes and weighted directed edges. The weights

indicate the distances in $km$ between the corresponding nodes. For example, the distance from

Node A to Node B is $15km.$

$(4)$ Use Dijkstra's algorithm to find the shortest path from Node A to Node H$.$ Work this out

out by hand.