Consider the following graph. S 4 9 3 M 14 Run Dijkstra's algorithm on this graph starting at node A. When you may select from among many next candidate nodes, prefer the node whichis alphabetically first. Note that we consider A to be the 1st node explored. After the 3rd node is explored, what is the current upper bound on the distance from A to F? Simply enter a numeric value as your answer. What is the 6th node explored? Simply enter a single capital letter as your answer.