Run Dijkstra's algorithm from s on the following graph. If necessary, use "INF" to represent positive infinity in your answers to the questions below. Note that we consider
s
to be the first node explored. What is the upper bound on the distance to
e
after the first node is explored? What is the second node explored? What is the upper bound on the distance to
e
after the third node is explored? What is the fifth node explored?