A company has factories in a series of different locations, all indicated by a letter in the following network. It has decided to take distances into consideration to select components for assembling.

In the network diagram given below, all the factory locations together with their distances have been indicated. Calculate the shortest path to the last node, L, where the packaging and the shipment are going to be made.

5 4

3 2

1 7

6 120 160 210 190 50 130 40 140 80 50 A

B C D

E F

G J

K L

4 3 8

10 6

4 1

1 4

3 3

2 3

1 2