Networks, STD2 N2 SM-Bank 10 Consider the network pictured below. Find the length of the shortest path from A to E. (2 marks) Show Answers Only `10` Show Worked Solution `text(One strategy - Using Dijkstra's algorithm:)` `text{The shortest path A - B - I - E has a distance (weight)}` `text(of 10.)`