Starting at node F$,$ in which order will the nodes in the graph be visited by Dijkstra's Algorithm?

Note: You must use the algorithm that was discussed in this course.

Note: If you encounter a tie between two nodes in the priority queue, the node that is alphabetically smaller has the higher priority $($i$.$e$.,$ is popped first$).$

Note: Order the items such that the first node to be visited is on top, and the last node to be visited is on the bottom.