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$=0783$a$1$fa$8518187463$e$00611697674$f$7$a$99$c$9$a$48$&il$\_$wac$\_$ttl$=10$&il$\_$wac$\_$ts$=1706025465$

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