Consider a diagram of a telephone network which consists of switching centres and communica- tion lines. Each communication goes between a pair of switching points, and has an associated bandwidth and a cost. 5.1 Give an algorithm that given two switching centres a and b, outputs the cost of a minimum cost path between a and b. 5.2 The bandwidth of a path of communication lines between two centres is the lowest bandwidth on the path. Give an algorithm that given two switching centres a and b outputs the maximum bandwidth of a path between a and b.