<p><img alt="4. Use Dijkstras algorithm to find the shortest path from node e to node b, and its length in the following graph. 7 (8 marks)" src="http://d2vlcm61l7u1fs.cloudfront.net/media%2F516%2F51697c58-7229-4ffa-bd3a-00bedfcf53bd%2FphplYG0NG.png" aria-describedby="d3f"/></p><p>i want all