4. A rally consisting of four stages is being planned. The first stage will begin at \(A\) and the last stage will end at \(L\). Various routes are being considered, with the end of one stage being the start of the next. The organisers want the total length of the route chosen to be as small as possible. The table below shows the length, in miles, of each of the possible stages.
| \multirow{2}{*}{} | Finishing point |
| | B | C | D | E | \(F\) | G | \(H\) | \(I\) | \(J\) | \(K\) | \(L\) |
| \multirow{11}{*}{Starting point} | A | 5 | 4.5 | 13 | 10 | | | | | | | |
| B | | | | | 8 | 11 | 4 | | | | |
| C | | | | | 5 | | 10.5 | | | | |
| D | | | | | 9 | | 6 | | | | |
| E | | | | | 12 | 7 | 15 | | | | |
| \(F\) | | | | | | | | 5 | 2 | 2 | |
| G | | | | | | | | 8 | 9 | 3 | |
| \(H\) | | | | | | | | 10 | 2 | 9 | |
| I | | | | | | | | | | | 5 |
| J | | | | | | | | | | | 6 |
| K | | | | | | | | | | | 10 |
Use dynamic programming to find the route which satisfies the wish of the organisers.