1 The shortest path problem is finding a path between two vertices (or nodes) in a network minimises the distance. It is whether undirected, directed, or mixed network. Figure Q1 shows an undirected network consisting of five nodes and the distances (in KM) are given on the arcs. 10 1 3 Figure Q1: An undirected network (a) Analyse the shortest path problem using Floyd Warshall algorithm. (10 marks) (b) Determine the shortest distance and shortest path from Node 4 to Node 1 using the result in 1(a). (1 mark)