Dijkstra's algorithm is a greedy algorithm to find the shortest paths within a graph. Apply the algorithm to the graph below and determine the cost of the resulting path between A and F$.$

Network.png$?$il$\_$wac$\_$token$=65$a$2$d$13$bc$12$d$61$d$0730620$e$081$e$15$ebcba$3$fd$800$&il$\_$wac$\_$ttl$=10$&il$\_$wac$\_$ts$=1706021030$

Determine the cost of the resulting path between A and F:

$($Hint: We are looking for an two$-$digit integer$)$