Homework Assignment #12.5

To apply Dijkstra's algorithm to find the shortest path between two nodes in a directed graph. Also, to gain further practice determining the order of growth for various functions.

Show all work. i.e., justify your answers.

Exercise 4.1 in the textbook

Exercise 4.2 in the textbook (start at S)

Exercise 0.1 in the textbook: parts (f), (h), (i), (j), (k)