Consider the directed graph with weighted edges below:

1) a) Using Figure 24.6 as a model, demonstrate Dijkstra's algorithm with source in node B. b) What is the shortest distance between B and E? c) What is the shortest distance between B and F?

2) a) Again, using Figure 24.6 as a model, demonstrate Dijkstra's algorithm with source in node C. b) What is the shortest distance between C and A? c) What is the shortest distance between C and B?

3) a) How is Dijkstra's algorithm algorithmically different than Breadth-First Search algorithm? b) How is Dijkstra's algorithm algorithmically different than Prim's algorithm for computing Minimum Spanning Trees?

4) (research) What is the Traveling-Salesman Problem (TSP)? Can you solve a TSP using Dijkstra's algorithms (or an adaptation of it)? Why (if your answer is No)? How (if your answer is Yes)?

0.5 0.1 0.4 0.45 0.3 0.3 0.4 0.6