Problem 12, page 355 of the textbook. Problem 13, page 356 of the textbook. Let C denote the set of Confirmed nodes, and T denote the set of Tentative nodes. E is least cost tentative node. C is least cost tentative node.
B is least cost tentative node.
Problem 14, page 356 of the textbook. Problem 15, page 356 of the textbook. We also assume that each node knows its distance from its immediate neighbours at all times. Problem 16, page 356 of the textbook.